Sciweavers

1117 search results - page 99 / 224
» Partial Models of Extended Generalized Logic Programs
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 1 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
15 years 10 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett
AIPS
2008
15 years 3 months ago
A Temporal Logic-Based Planning and Execution Monitoring System
As no plan can cover all possible contingencies, the ability to detect failures during plan execution is crucial to the robustness of any autonomous system operating in a dynamic ...
Jonas Kvarnström, Fredrik Heintz, Patrick Doh...
134
Voted
DAC
2003
ACM
16 years 2 months ago
Behavioral consistency of C and verilog programs using bounded model checking
We present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking. Both the circuit and the program ...
Edmund M. Clarke, Daniel Kroening, Karen Yorav
HYBRID
2010
Springer
15 years 8 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...