Sciweavers

104 search results - page 5 / 21
» A Type System Equivalent to a Model Checker
Sort
View
ESWS
2009
Springer
13 years 5 months ago
Towards an Agent Based Approach for Verification of OWL-S Process Models
Abstract. In this paper we investigate the transformation of OWL-S process models to ISPL - the system description language for MCMAS, a symbolic model checker for multi agent syst...
Alessio Lomuscio, Monika Solanki
DATE
2005
IEEE
119views Hardware» more  DATE 2005»
14 years 1 months ago
Functional Validation of System Level Static Scheduling
Increase in system level modeling has given rise to a need for efficient functional validation of models above cycle accurate level. This paper presents a technique for comparing...
Samar Abdi, Daniel D. Gajski
ENTCS
2007
126views more  ENTCS 2007»
13 years 7 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
LICS
2008
IEEE
14 years 1 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
BIRTHDAY
2003
Springer
14 years 20 days ago
Fair Equivalence Relations
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi