Sciweavers

504 search results - page 42 / 101
» Observational Logic
Sort
View
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
14 years 2 months ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri
JIIS
2008
104views more  JIIS 2008»
13 years 8 months ago
A framework for checking proofs naturally
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
Masahiko Sato
ATAL
2005
Springer
14 years 2 months ago
Design by Contract Deontic Design Language for Multiagent Systems
Abstract. Design by contract is a well known theory that views software construction as based on contracts between clients (callers) and suppliers (routines), relying on mutual obl...
Christophe Garion, Leendert van der Torre
MJ
2008
67views more  MJ 2008»
13 years 8 months ago
Temperature-adaptive voltage tuning for enhanced energy efficiency in ultra-low-voltage circuits
Circuits optimized for minimum energy consumption operate typically in the subthreshold regime with ultra-low power-supply voltages. Speed of a subthreshold logic circuit is enhan...
Ranjith Kumar, Volkan Kursun
ACS
2008
13 years 8 months ago
On Minimal Coalgebras
Abstract. We define an out-degree for F-coalgebras and show that the coalgebras of outdegree at most form a covariety. As a subcategory of all Fcoalgebras, this class has a termin...
H. Peter Gumm