551 search results - page 41 / 111 » Formalizing the Logic-Automaton Connection |
183
click to vote
Book
"These course notes are addressed to a wide audience of people interested in modern programming languages in general, ML-like languages in particular, or simply in OCaml, whet...
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
ACSD
2005
IEEE
15 years 3 months ago
2005
IEEE
We describe a toolbox for the analysis of Systems-on-achip described in SystemC at the transactional level. The tools are able to extract information from SystemC code, and to bui...
AMAST
2004
Springer
15 years 3 months ago
2004
Springer
Component adaptation is widely recognised to be one of the crucial problems in Component-Based Software Engineering. The objective of this paper is to set a formal foundation for t...
PPSWR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Time is omnipresent on the (Semantic) Web. However, formalism like XML, XML Schema, RDF, OWL and (Semantic) Web query languages have, if any, only very limited notions of...