SAT-based verification for timed component connectors

DOI10.1016/j.scico.2011.02.003zbMath1279.68212OpenAlexW2137162774MaRDI QIDQ433331

Stephanie Kemper

Publication date: 13 July 2012

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2011.02.003

zbMATH Keywords

model checkingSATabstraction refinementcomponent-based software engineeringtimed constraint automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Linear templates of ACTL formulas with an application to SAT-based verification

Uses Software

• Reo
• Chaff
• FOCI
• Esterel

Cites Work

• Calculi for synchrony and asynchrony
• A timed model for communicating sequential processes
• A brief history of process algebra
• Process algebra with timing
• Modeling component connectors in Reo by constraint automata
• Abstractions from proofs
• Reo: a channel-based coordination model for component composition
• Tools and Algorithms for the Construction and Analysis of Systems
• Computer Aided Verification
• Bounded model checking using satisfiability solving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: SAT-based verification for timed component connectors