Sciweavers

264 search results - page 38 / 53
» Expressing Iterative Properties Logically in a Symbolic Sett...
Sort
View
CADE
2009
Springer
15 years 12 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
CONCUR
2001
Springer
15 years 3 months ago
Probabilistic Information Flow in a Process Algebra
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...
Alessandro Aldini
APLAS
2007
ACM
15 years 3 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
LOGCOM
2000
63views more  LOGCOM 2000»
14 years 11 months ago
Reflection principles in computational logic
We introduce the concept of reflection principle as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of l...
Jonas Barklund, Pierangelo Dell'Acqua, Stefania Co...
ICCS
2007
Springer
15 years 3 months ago
Building Verifiable Sensing Applications Through Temporal Logic Specification
Abstract. Sensing is at the core of virtually every DDDAS application. Sensing applications typically involve distributed communication and coordination over large self-organized n...
Asad Awan, Ahmed H. Sameh, Suresh Jagannathan, Ana...