Sciweavers

10575 search results - page 1585 / 2115
» T2Script Programming Language
Sort
View
IEEEPACT
2002
IEEE
15 years 12 months ago
Speculative Alias Analysis for Executable Code
Optimizations performed at link time or directly applied to final program executables have received increased attention in recent years. Such low-level optimizations can benefit...
Manel Fernández, Roger Espasa
APLAS
2009
ACM
15 years 11 months ago
Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP...
Hongfei Fu
LOPSTR
2009
Springer
15 years 11 months ago
Towards a Framework for Constraint-Based Test Case Generation
In this paper, we propose an approach for automated test case generation based on techniques from constraint programming (CP). We advocate the use of standard CP search strategies ...
François Degrave, Tom Schrijvers, Wim Vanho...
140
Voted
TACS
2001
Springer
15 years 11 months ago
Non-structural Subtype Entailment in Automata Theory
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
Joachim Niehren, Tim Priesnitz
CSFW
2000
IEEE
15 years 11 months ago
Reasoning about Secrecy for Active Networks
In this paper we develop a language of mobile agents called uPLAN for describing the capabilities of active (programmable) networks. We use a formal semantics for uPLAN to demonst...
Pankaj Kakkar, Carl A. Gunter, Martín Abadi
« Prev « First page 1585 / 2115 Last » Next »