CONCUR 2005 – Concurrency Theory
From MaRDI portal
Publication:5897503
DOI10.1007/11539452zbMath1134.68343OpenAlexW1737342522MaRDI QIDQ5897503
Henny B. Sipma, Zohar Manna, Aaron R. Bradley
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11539452
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (13)
On the Termination of Integer Loops ⋮ Convergence: integrating termination and abort-freedom ⋮ Recent advances in program verification through computer algebra ⋮ Generating exact nonlinear ranking functions by symbolic-numeric hybrid method ⋮ Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods ⋮ What's decidable about discrete linear dynamical systems? ⋮ Proving termination of nonlinear command sequences ⋮ Ranking function synthesis for bit-vector relations ⋮ Programs with lists are counter automata ⋮ Automatic Verification of Counter Systems With Ranking Function ⋮ Unnamed Item ⋮ Ranking Functions for Linear-Constraint Loops ⋮ Algebraic model checking for discrete linear dynamical systems
This page was built for publication: CONCUR 2005 – Concurrency Theory
