Sciweavers

2465 search results - page 50 / 493
» Automata on Linear Orderings
Sort
View
FORMATS
2006
Springer
13 years 11 months ago
Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata
Using a variant of Clariso-Cortadella's parametric method for verifying asynchronous circuits, we formally derive a set of linear constraints that ensure the correctness of so...
Remy Chevallier, Emmanuelle Encrenaz-Tiphèn...
WIA
2009
Springer
14 years 2 months ago
Short Regular Expressions from Finite Automata: Empirical Results
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
Hermann Gruber, Markus Holzer, Michael Tautschnig
TPHOL
2005
IEEE
14 years 1 months ago
From PSL to LTL: A Formal Validation in HOL
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
Thomas Tuerk, Klaus Schneider
VR
2003
IEEE
192views Virtual Reality» more  VR 2003»
14 years 1 months ago
Interactive Flowing of Highly Viscous Volumes in Virtual Environments
We present a simple and linear 3D cellular automata approach for animating the behaviors of viscous flow volumes in virtual environments. An accurate modeling of fluid flow usu...
Xiaoming Wei, Wei Li, Arie E. Kaufman
ITP
2010
179views Mathematics» more  ITP 2010»
13 years 11 months ago
The Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
Peter Lammich, Andreas Lochbihler