Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Constraint-based deductive model checking

From MaRDI portal
Publication:5953447
Jump to:navigation, search

DOI10.1007/s100090100049zbMath0991.68013OpenAlexW1813383841WikidataQ126579025 ScholiaQ126579025MaRDI QIDQ5953447

Andreas Podelski, Giorgio Delzanno

Publication date: 23 January 2002

Published in: International Journal on Software Tools for Technology Transfer. STTT (Search for Journal in Brave)

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

zbMATH Keywords

concurrent systemsconstraint logic programming


Mathematics Subject Classification ID

Logic programming (68N17)


Related Items

Unnamed Item, Rewriting modulo SMT and open system analysis, Analysis and Transformation of Constrained Horn Clauses for Program Verification, Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation, Horn clause verification with convex polyhedral abstraction and tree automata-based refinement, Generalized rewrite theories, coherence completion, and symbolic methods


Uses Software

  • HyTech
  • Uppaal


Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5953447&oldid=12116888"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki