Sciweavers

317 search results - page 49 / 64
» Bounded Model Checking with QBF
Sort
View
POPL
2009
ACM
16 years 10 days ago
Types and higher-order recursion schemes for verification of higher-order programs
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
Naoki Kobayashi
ENTCS
2006
103views more  ENTCS 2006»
14 years 11 months ago
Supporting SAT based BMC on Finite Path Models
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Ra...
RTAS
2009
IEEE
15 years 6 months ago
Execution Strategies for PTIDES, a Programming Model for Distributed Embedded Systems
—We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed Embedded Systems). A PTIDES application (factory a...
Jia Zou, Slobodan Matic, Edward A. Lee, Thomas Hui...
ISTCS
1992
Springer
15 years 3 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
16 years 1 months ago
Simultaneous Equation Systems for Query Processing on Continuous-Time Data Streams
We introduce Pulse, a framework for processing continuous queries over models of continuous-time data, which can compactly and accurately represent many real-world activities and p...
Jennie Rogers, Olga Papaemmanouil, Ugur Çet...