Sciweavers

971 search results - page 70 / 195
» Approximate Satisfiability and Equivalence
Sort
View
ICFCA
2007
Springer
14 years 1 months ago
A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets
Different rule semantics have been successively defined in many contexts such as implications in artificial intelligence, functional dependencies in databases or association rules...
Marie Agier, Jean-Marc Petit
DATE
2004
IEEE
184views Hardware» more  DATE 2004»
14 years 1 months ago
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
Panagiotis Manolios, Sudarshan K. Srinivasan
APSEC
2008
IEEE
14 years 3 hour ago
A Verification Framework for FBD Based Software in Nuclear Power Plants
Formal verification of Function Block Diagram (FBD) based software is an essential task when replacing traditional relay-based analog system with PLC-based software in nuclear rea...
Junbeom Yoo, Sung Deok Cha, Eunkyoung Jee
AIIDE
2009
13 years 11 months ago
Evaluating the Authorial Leverage of Drama Management
A drama manager (DM) monitors an interactive experience, such as a computer game, and intervenes to shape the global experience so that it satisfies the author's expressive g...
Sherol Chen, Mark J. Nelson, Michael Mateas
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 5 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...