Verification of sets of infinite state processes using program transformation

DOI10.1007/3-540-45607-4_7MaRDI QIDQ4808811zbMATH OpenFDO

Authors Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti

Publication date 12 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2372/23720111.htm

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1406234
• Program Development in Computational Logic
• Generalization strategies for the verification of infinite state systems
• Program specialization for verifying infinite state systems: an experimental evaluation
• Automated Technology for Verification and Analysis

Cited in

(10)

• Verifying of interface assertions for infinite state Mealy machines
• Extending co-logic programs for branching-time model checking
• Deciding full branching time logic by program transformation
• Verification of infinite-state systems by specialization of CLP programs
• scientific article; zbMATH DE number 1406234 (Why is no real title available?)
• Generate \& check method for verifying transition systems in CafeOBJ
• scientific article; zbMATH DE number 2222694 (Why is no real title available?)
• Program Development in Computational Logic
• Automata, Languages and Programming
• A framework for the verification of infinite-state graph transformation systems

Describes a project that uses

Uses Software

• MONA

This page was built for publication: Verification of sets of infinite state processes using program transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808811)