Sciweavers

504 search results - page 92 / 101
» Explaining Verification Conditions
Sort
View
POPL
2010
ACM
14 years 6 months ago
Continuity Analysis of Programs
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerm...
SENSYS
2005
ACM
14 years 2 months ago
Estimating clock uncertainty for efficient duty-cycling in sensor networks
Radio duty cycling has received significant attention in sensor networking literature, particularly in the form of protocols for medium access control and topology management. Whi...
Saurabh Ganeriwal, Deepak Ganesan, Hohyun Shim, Vl...
RTSS
1999
IEEE
14 years 1 months ago
High-Level Modeling and Analysis of TCAS
In this paper, we demonstrate a high-level approach to modeling and analyzing complex safety-critical systems through a case study in the area of air traffic management. In partic...
Carolos Livadas, John Lygeros, Nancy A. Lynch
EURODAC
1994
IEEE
209views VHDL» more  EURODAC 1994»
14 years 1 months ago
MOS VLSI circuit simulation by hardware accelerator using semi-natural models
- The accelerator is destined to circuit-level simulation of digital and analog/digital MOS VLSI'c containing of up to 100 thousand transistors (with 16 Mb RAM host-machine). ...
Victor V. Denisenko
AAAI
2008
13 years 11 months ago
Existentially Quantified Values for Queries and Updates of Facts in Transaction Logic Programs
In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete f...
Paul Fodor