110 search results - page 16 / 22 » Domains of Higher-Dimensional Automata |
POPL
2003
ACM
14 years 9 months ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
DEBS
2009
ACM
14 years 3 months ago
2009
ACM
The nature of data in enterprises and on the Internet is changing. Data used to be stored in a database first and queried later. Today timely processing of new data, represented ...
ICLP
2005
Springer
14 years 2 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
ICDAR
1995
IEEE
14 years 5 days ago
1995
IEEE
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the dat...