Sciweavers

373 search results - page 3 / 75
» Analysis of Recursive State Machines
Sort
View
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
15 years 4 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
ECML
2007
Springer
15 years 1 months ago
Efficient Computation of Recursive Principal Component Analysis for Structured Input
Recently, a successful extension of Principal Component Analysis for structured input, such as sequences, trees, and graphs, has been proposed. This allows the embedding of discret...
Alessandro Sperduti
PG
2003
IEEE
15 years 3 months ago
A State Machine for Real-Time Cutting of Tetrahedral Meshes
We introduce an algorithm that consistently and accurately processes arbitrary intersections in tetrahedral meshes in real-time. The intersection surfaces are modeled up to the cu...
Daniel Bielser, Pascal Glardon, Matthias Teschner,...
ACL2
2006
ACM
15 years 3 months ago
A SAT-based procedure for verifying finite state machines in ACL2
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
Warren A. Hunt Jr., Erik Reeber
DATE
1999
IEEE
80views Hardware» more  DATE 1999»
15 years 2 months ago
Symbolic Reachability Analysis of Large Finite State Machines Using Don't Cares
Reachability analysis of finite state machines is essential to many computer-aided design applications. We present new techniques to improve both approximate and exact reachabilit...
Youpyo Hong, Peter A. Beerel