Sciweavers

1147 search results - page 1 / 230
» Termination in language-based systems
Sort
View
DSN
2002
IEEE
13 years 10 months ago
Transactional Rollback for Language-Based Systems
Language run-time systems are routinely used to host potentially buggy or malicious codelets — software modules, agents, applets, etc. — in a secure environment. A number of t...
Algis Rudys, Dan S. Wallach
IS
2008
13 years 5 months ago
DFL: A dataflow language based on Petri nets and nested relational calculus
In this paper we propose DFL -- a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated, and the structure of the ...
Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Je...
ICFP
2012
ACM
11 years 7 months ago
Addressing covert termination and timing channels in concurrent information flow systems
When termination of a program is observable by an adversary, confidential information may be leaked by terminating accordingly. While this termination covert channel has limited ...
Deian Stefan, Alejandro Russo, Pablo Buiras, Amit ...
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 3 months ago
MiniAgda: Integrating Sized and Dependent Types
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
Andreas Abel
ENTCS
2008
85views more  ENTCS 2008»
13 years 5 months ago
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...
Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe