Sciweavers

1134 search results - page 141 / 227
» Sequential Inductive Learning
Sort
View
FCT
2007
Springer
15 years 4 months ago
Rewriting Systems with Data
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
TLCA
2005
Springer
15 years 3 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
FMCAD
2004
Springer
15 years 3 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi
MICRO
2002
IEEE
159views Hardware» more  MICRO 2002»
15 years 2 months ago
Master/slave speculative parallelization
Master/Slave Speculative Parallelization (MSSP) is an execution paradigm for improving the execution rate of sequential programs by parallelizing them speculatively for execution ...
Craig B. Zilles, Gurindar S. Sohi
DL
2000
Springer
164views Digital Library» more  DL 2000»
15 years 2 months ago
Scalable browsing for large collections: a case study
Phrase browsing techniques use phrases extracted automatically from a large information collection as a basis for browsing and accessing it. This paper describes a case study that...
Gordon W. Paynter, Ian H. Witten, Sally Jo Cunning...