Sciweavers

79 search results - page 4 / 16
» Realizability of Concurrent Recursive Programs
Sort
View
APSEC
1997
IEEE
14 years 3 months ago
A Test-case Generation Method for Concurrent Programs Including Task-types
A task-type in concurrent programs is a template of task-instances which are dynamically generated in execution of the programs. The number of the generated taskinstances may not ...
Tetsuro Katayama, Zengo Furukawa, Kazuo Ushijima
AAAI
2008
13 years 12 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
MSCS
1998
58views more  MSCS 1998»
13 years 10 months ago
Minimal Realization in Bicategories of Automata
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
Robert D. Rosebrugh, Nicoletta Sabadini, Robert F....
PLDI
2009
ACM
14 years 5 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
CSL
1999
Springer
14 years 3 months ago
A Truly Concurrent Semantics for a Simple Parallel Programming Language
Abstract. This paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, parallelism and...
Paul Gastin, Michael W. Mislove