Automata, Languages and Programming

DOI10.1007/11523468zbMath1081.68568OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716758

Aaron R. Bradley, Zohar Manna, Henny B. Sipma

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (9)

Termination of Single-Path Polynomial Loop Programs ⋮ Convergence: integrating termination and abort-freedom ⋮ A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis ⋮ Unnamed Item ⋮ Temporal property verification as a program analysis task ⋮ Time-bounded termination analysis for probabilistic programs with delays ⋮ Proving termination of nonlinear command sequences ⋮ Invariants for parameterised Boolean equation systems ⋮ Synthesizing ranking functions for loop programs via SVM

This page was built for publication: Automata, Languages and Programming