Sciweavers

799 search results - page 12 / 160
» A Logic for Abstract State Machines
Sort
View
TOPLAS
1998
113views more  TOPLAS 1998»
13 years 7 months ago
An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programs
Konstantinos F. Sagonas, Terrance Swift
EH
1999
IEEE
351views Hardware» more  EH 1999»
13 years 11 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
DAC
1996
ACM
13 years 11 months ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
Hiroyuki Higuchi, Yusuke Matsunaga
CAV
1998
Springer
138views Hardware» more  CAV 1998»
13 years 11 months ago
Model Checking for a First-Order Temporal Logic Using Multiway Decision Graphs
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
Ying Xu, Eduard Cerny, Xiaoyu Song, Francisco Core...