Sciweavers

615 search results - page 27 / 123
» High-Level Nondeterministic Abstractions in
Sort
View
DLT
2009
13 years 7 months ago
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
Aleksi Saarela
ENTCS
2008
110views more  ENTCS 2008»
13 years 9 months ago
Game-Based Probabilistic Predicate Abstraction in PRISM
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
Mark Kattenbelt, Marta Z. Kwiatkowska, Gethin Norm...
LICS
2009
IEEE
14 years 4 months ago
Trace Semantics is Fully Abstract
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
Sumit Nain, Moshe Y. Vardi
FMCO
2005
Springer
156views Formal Methods» more  FMCO 2005»
14 years 3 months ago
On a Probabilistic Chemical Abstract Machine and the Expressiveness of Linda Languages
babilistic Chemical Abstract Machine and the Expressiveness of Linda Languages Alessandra Di Pierro1 , Chris Hankin2 , and Herbert Wiklicky2 1 Dipartimento di Informatica, Universi...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
ISCAS
2003
IEEE
135views Hardware» more  ISCAS 2003»
14 years 3 months ago
Formal verification of LTL formulas for SystemC designs
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
Daniel Große, Rolf Drechsler