Sciweavers

278 search results - page 50 / 56
» Enumerating Regular Expressions and Their Languages
Sort
View
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 4 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
ANCS
2007
ACM
15 years 3 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
ASPLOS
2006
ACM
15 years 5 months ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...
POPL
2010
ACM
15 years 2 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...
BTW
2003
Springer
129views Database» more  BTW 2003»
15 years 5 months ago
Type Checking in XOBE
: XML is the upcoming standard for internet data. Java is the most important programming language for internet applications. Nevertheless, in today’s languages and tools there is...
Martin Kempa, Volker Linnemann