Sciweavers

SPIN
2010
Springer
13 years 5 months ago
Enacting Declarative Languages Using LTL: Avoiding Errors and Improving Performance
In our earlier work we have proposed using the declarative language DecSerFlow for modeling, analysis and enactment of processes in autonomous web services. DecSerFlow uses constra...
Maja Pesic, Dragan Bosnacki, Wil M. P. van der Aal...
SPIN
2010
Springer
13 years 5 months ago
The SpinJa Model Checker
SpinJa is a model checker for promela, implemented in Java. SpinJa is designed to behave similarly to Spin, but to be more easily extendible and reusable. Despite the fact that Spi...
Marc de Jonge, Theo C. Ruys
SPIN
2010
Springer
13 years 5 months ago
Experimental Comparison of Concolic and Random Testing for Java Card Applets
Concolic testing is a method for test input generation where a given program is executed both concretely and symbolically at the same time. This paper introduces the LIME Concolic ...
Kari Kähkönen, Roland Kindermann, Keijo ...
SPIN
2010
Springer
13 years 5 months ago
Symbolic Object Code Analysis
Jan Tobias Mühlberg, Gerald Lüttgen
SPIN
2010
Springer
13 years 5 months ago
Automatic Generation of Model Checking Scripts Based on Environment Modeling
When applying model checking to the design models of the embedded systems, it is necessary to model not only the behavior of the target system but also that of the environment inte...
Kenro Yatake, Toshiaki Aoki
SPIN
2010
Springer
13 years 5 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong
SIAMDM
2010
99views more  SIAMDM 2010»
13 years 5 months ago
Reductions of Young Tableau Bijections
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Scie...
Igor Pak, Ernesto Vallejo
RTA
2010
Springer
13 years 5 months ago
The Undecidability of Type Related Problems in Type-free Style System F
We consider here a number of variations on the System F, that are predicative second-order systems whose terms are intermediate between the Curry style and Church style. The terms ...
Ken-etsu Fujita, Aleksy Schubert
RTA
2010
Springer
13 years 5 months ago
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and...
Friedrich Neurauter, Aart Middeldorp
MFCS
2010
Springer
13 years 5 months ago
A dexptime-Complete Dolev-Yao Theory with Distributive Encryption
In the context of modelling cryptographic tools like blind signatures and homomorphic encryption, the DolevYao model is typically extended with an operator over which encryption i...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh