Sciweavers

264 search results - page 41 / 53
» Expressing Iterative Properties Logically in a Symbolic Sett...
Sort
View
LICS
2003
IEEE
15 years 4 months ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
ICLP
1997
Springer
15 years 3 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
DIMACS
1996
15 years 16 days ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
STEP
2005
IEEE
15 years 4 months ago
Elemental Design Patterns Recognition In Java
The decomposition of design patterns into simpler elements may reduce significantly the creation of variants in forward engineering, while it increases the possibility of identify...
Francesca Arcelli Fontana, Stefano Masiero, Claudi...
DAC
1994
ACM
15 years 3 months ago
Automatic Verification of Pipelined Microprocessors
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
Vishal Bhagwati, Srinivas Devadas