Sciweavers

369 search results - page 15 / 74
» Symbolic Semantics Revisited
Sort
View
LICS
2003
IEEE
14 years 1 months ago
Revisiting Digitization, Robustness, and Decidability for Timed Automata
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to d...
Joël Ouaknine, James Worrell
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
14 years 13 days ago
Qualitative diagnosability of labeled petri nets revisited
Abstract— In recent years, classical discrete event fault diagnosis techniques have been extended to Petri Net system models under partial order semantics [8], [9], [13]. In [14]...
Stefan Haar
DLOG
2008
13 years 10 months ago
Partitioning OWL Knowledge Bases - Revisited and Revised
The development of scalable reasoning systems is one of the crucial factors determining the success of Semantic Web systems. Recently, in [GH06], an approach is proposed, which tac...
Sebastian Wandelt
CADE
2007
Springer
14 years 8 months ago
Inferring Invariants by Symbolic Execution
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
Benjamin Weiß, Peter H. Schmitt
TCS
2008
13 years 7 months ago
Sound and complete computational interpretation of symbolic hashes in the standard model
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
Flavio D. Garcia, Peter van Rossum