Sciweavers

FOSSACS
2011
Springer
12 years 11 months ago
Regularity and Context-Freeness over Word Rewriting Systems
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...
Didier Caucal, Dinh Trong Hieu
FOSSACS
2011
Springer
12 years 11 months ago
Similarity Quotients as Final Coalgebras
We give a general framework connecing a branching time relation on nodes of a transition system to a final coalgebra for a suitable endofunctor. Examples of relations treated by o...
Paul Blain Levy
FOSSACS
2011
Springer
12 years 11 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...
FASE
2011
Springer
12 years 11 months ago
Automated Learning of Probabilistic Assumptions for Compositional Reasoning
Probabilistic verification techniques have been applied to the formal modelling and analysis of a wide range of systems, from communication protocols such as Bluetooth, to nanosca...
Lu Feng, Marta Z. Kwiatkowska, David Parker
FASE
2011
Springer
12 years 11 months ago
Testing Container Classes: Random or Systematic?
Abstract. Container classes such as lists, sets, or maps are elementary data structures common to many programming languages. Since they are a part of standard libraries, they are ...
Rohan Sharma, Milos Gligoric, Andrea Arcuri, Gordo...
FASE
2011
Springer
12 years 11 months ago
Type-Safe Evolution of Spreadsheets
Abstract. Spreadsheets are notoriously error-prone. To help avoid the introduction of errors when changing spreadsheets, models that capture the structure and interdependencies of ...
Jácome Cunha, Joost Visser, Tiago L. Alves,...
FASE
2011
Springer
12 years 11 months ago
Theoretical Aspects of Compositional Symbolic Execution
Given a program and an assertion in that program, determining if the assertion can fail is one of the key applications of program analysis. Symbolic execution is a well-known techn...
Dries Vanoverberghe, Frank Piessens
FASE
2011
Springer
12 years 11 months ago
An Empirical Study on Evolution of API Documentation
With the evolution of an API library, its documentation also evolves. The evolution of API documentation is common knowledge for programmers and library developers, but not in a qu...
Lin Shi, Hao Zhong, Tao Xie, Mingshu Li
EUROSYS
2011
ACM
12 years 11 months ago
Is co-scheduling too expensive for SMP VMs?
Symmetric multiprocessing (SMP) virtual machines (VMs) allow users to take advantage of a multiprocessor infrastructure. Despite the advantage, SMP VMs can cause synchronization l...
Orathai Sukwong, Hyong S. Kim