391 search results - page 24 / 79 » Formal Universes |
122
Voted
ATVA
2011
Springer
14 years 12 days ago
2011
Springer
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...
105
click to vote
SAS
2009
Springer
2009
Springer
Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology
16 years 29 days ago
parsing: static analysis of dynamically generated string output using LR-parsing technology Kyung-Goo Doh1 , Hyunha Kim1 , David A. Schmidt2 1 Hanyang University, Ansan, South Kore...
124
Voted
TIME
2006
IEEE
15 years 6 months ago
2006
IEEE
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
TYPES
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
96
Voted
CALCO
2007
Springer
15 years 6 months ago
2007
Springer
In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his go...