Sciweavers

4716 search results - page 609 / 944
» Iterative-free program analysis
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 6 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...
FAC
2008
100views more  FAC 2008»
15 years 6 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
KES
2006
Springer
15 years 6 months ago
Solving power and trust conflicts through argumentation in agent-mediated knowledge distribution
Distributing pieces of knowledge in large, usually distributed organizations is a central problem in Knowledge and Organization management. Policies for distributing knowledge and...
Carlos Iván Chesñevar, Ramón ...
ENTCS
2007
126views more  ENTCS 2007»
15 years 6 months ago
Context Dependent Procedures and Computed Types in -eriFun
We present two enhancements of the functional language L which is used in the eriFun system to write programs and formulate statements about them. Context dependent procedures all...
Andreas Schlosser, Christoph Walther, Michael Gond...
VLDB
2002
ACM
122views Database» more  VLDB 2002»
15 years 6 months ago
Lightweight Flexible Isolation for Language-based Extensible Systems
Safe programming languages encourage the development of dynamically extensible systems, such as extensible Web servers and mobile agent platforms. Although protection is of utmost...
Laurent Daynès, Grzegorz Czajkowski