Sciweavers

202 search results - page 21 / 41
» From Model Checking to a Temporal Proof
Sort
View
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
FMSD
2010
118views more  FMSD 2010»
13 years 6 months ago
On simulation-based probabilistic model checking of mixed-analog circuits
In this paper, we consider verifying properties of mixed-signal circuits, i.e., circuits for which there is an interaction between analog (continuous) and digital (discrete) values...
Edmund M. Clarke, Alexandre Donzé, Axel Leg...
PADS
2009
ACM
14 years 2 months ago
An Approach for Validation of Semantic Composability in Simulation Models
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the n...
Claudia Szabo, Yong Meng Teo
FMCAD
2004
Springer
14 years 27 days ago
Proof Styles in Operational Semantics
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
Sandip Ray, J. Strother Moore
DALT
2004
Springer
14 years 28 days ago
Representational Content and the Reciprocal Interplay of Agent and Environment
Declarative modelling approaches in principle assume a notion of representation or representational content for the modelling concepts. The notion of representational content as di...
Tibor Bosse, Catholijn M. Jonker, Jan Treur