Sciweavers

99 search results - page 3 / 20
» Temporal Decomposition for Logic Optimization
Sort
View
ISSTA
2004
ACM
13 years 11 months ago
An optimizing compiler for batches of temporal logic formulas
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
James Ezick
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 6 months ago
Optimal Path Planning under Temporal Logic Constraints
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...
ASIAN
2003
Springer
102views Algorithms» more  ASIAN 2003»
13 years 11 months ago
Generating Optimal Linear Temporal Logic Monitors by Coinduction
Abstract. A coinduction-based technique to generate an optimal monitor from a Linear Temporal Logic (LTL) formula is presented in this paper. Such a monitor receives a sequence of ...
Koushik Sen, Grigore Rosu, Gul Agha
POPL
2002
ACM
14 years 6 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
ICCAD
1991
IEEE
100views Hardware» more  ICCAD 1991»
13 years 9 months ago
Layout Driven Logic Restructuring/Decomposition
As feature sizes decrease and chip sizes increase, the area and performance of chips become dominated by the interconnect. In spite of this trend, most existing synthesis systems ...
Massoud Pedram, Narasimha B. Bhat