Results 1  10
of
10
Static analysis for Java Servlets and JSP
 In Proc. 13th International Static Analysis Symposium, SAS ’06, volume 4134 of LNCS
, 2006
"... Abstract. We present an approach for statically reasoning about the behavior of Web applications that are developed using Java Servlets and JSP. Specifically, we attack the problems of guaranteeing that all output is wellformed and valid XML and ensuring consistency of XHTML form fields and session ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
Abstract. We present an approach for statically reasoning about the behavior of Web applications that are developed using Java Servlets and JSP. Specifically, we attack the problems of guaranteeing that all output is wellformed and valid XML and ensuring consistency of XHTML form fields and session state. Our approach builds on a collection of program analysis techniques developed earlier in the JWIG and Xact projects, combined with work on balanced contextfree grammars. Together, this provides the necessary foundation concerning reasoning about output streams and application control flow. 1
On finite alphabets and infinite bases III: Simulation
 Proc. CONCUR’06, LNCS 4137
, 2006
"... Abstract. This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least two actions, the (in)equational theory of BCCSP modulo simulation preorder or equivalence does not have a fin ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
Abstract. This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least two actions, the (in)equational theory of BCCSP modulo simulation preorder or equivalence does not have a finite basis. In contrast, in the presence of an alphabet that is infinite or a singleton, the equational theory for simulation equivalence does have a finite basis. 1
The Saga of the Axiomatization of Parallel Composition ⋆
"... Abstract. This paper surveys some classic and recent results on the finite axiomatizability of bisimilarity over CCSlike languages. It focuses, in particular, on nonfinite axiomatizability results stemming from the semantic interplay between parallel composition and nondeterministic choice. The pa ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract. This paper surveys some classic and recent results on the finite axiomatizability of bisimilarity over CCSlike languages. It focuses, in particular, on nonfinite axiomatizability results stemming from the semantic interplay between parallel composition and nondeterministic choice. The paper also highlights the role that auxiliary operators, such as Bergstra and Klop’s left and communication merge and Hennessy’s merge operator, play in the search for a finite, equational axiomatization of parallel composition both for classic process algebras and for their realtime extensions. 1 The Problem and its History Process algebras are prototype description languages for reactive systems that arose from the pioneering work of figures like Bergstra, Hoare, Klop and Milner. Wellknown examples of such languages are ACP [18], CCS [44], CSP [40] and Meije [13]. These algebraic description languages for processes differ in the basic collection of operators that they offer for building new process descriptions from existing ones. However, since they are designed to allow for the description and analysis of systems of interacting processes, all these languages contain some form of parallel composition (also known as merge) operator allowing one to put two process terms in parallel with one another. These operators usually interleave the behaviours of their arguments, and support some form of synchronization between them. For example, Milner’s CCS offers the binary operator , whose intended semantics is described by the following classic rules in the style of Plotkin [49]. x µ → x ′ x   y µ → x ′   y y µ → y ′ x   y µ → x   y ′ x α → x ′ , y ¯α → y ′ x   y τ → x ′   y ′ (In the above rules, the symbol µ stands for an action that a process may perform, α and ¯α are two observable actions that may synchronize, and τ is a symbol denoting the result of their synchronization.)
Complete and ready simulation semantics are not finitely based over BCCSP, even . . .
, 2011
"... ..."
Rule Formats for Distributivity
, 2011
"... This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of leftdistributivity laws from the literature are shown to be instances of the provided formats. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of leftdistributivity laws from the literature are shown to be instances of the provided formats.
Axiomatizing Weak Ready Simulation Semantics over BCCSP
"... Ready simulation has proven to be one of the most significant semantics in process theory. It is at the heart of a number of general results that pave the way to a comprehensive understanding of the spectrum of process semantics. Since its original definition by Bloom, Istrail and Meyer in 1995, sev ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Ready simulation has proven to be one of the most significant semantics in process theory. It is at the heart of a number of general results that pave the way to a comprehensive understanding of the spectrum of process semantics. Since its original definition by Bloom, Istrail and Meyer in 1995, several authors have proposed generalizations of ready simulation to deal with internal actions. However, a thorough study of the (non)existence of finite (in)equational bases for weak ready simulation semantics is still missing in the literature. This paper presents a complete account of positive and negative results on the axiomatizability of weak ready simulation semantics over the language BCCSP. In addition, this study offers a thorough analysis of the axiomatizability properties of weak simulation semantics.
www.elsevier.com/locate/ic On finite alphabets and infinite bases
, 2007
"... Van Glabbeek presented the linear time–branching time spectrum of behavioral semantics. He studied these semantics in the setting of the basic process algebra BCCSP, and gave finite, sound and groundcomplete, axiomatizations for most of these semantics. Groote proved for some of van Glabbeek’s axio ..."
Abstract
 Add to MetaCart
(Show Context)
Van Glabbeek presented the linear time–branching time spectrum of behavioral semantics. He studied these semantics in the setting of the basic process algebra BCCSP, and gave finite, sound and groundcomplete, axiomatizations for most of these semantics. Groote proved for some of van Glabbeek’s axiomatizations that they are ωcomplete, meaning that an equation can be derived if (and only if) all of its closed instantiations can be derived. In this paper, we settle the remaining open questions for all the semantics in the linear time–branching time spectrum, either positively by giving a finite sound and groundcomplete axiomatization that is ωcomplete, or negatively by proving that such a finite basis for the equational theory does not exist. We prove that in case of a finite alphabet with at least two actions, failure semantics affords a finite basis, while for ready simulation, completed simulation, simulation, possible worlds, ready trace, failure trace and ready semantics, such a finite basis does not exist. Completed simulation semantics also lacks a finite basis in case of an infinite alphabet of actions. © 2007 Elsevier Inc. All rights reserved.
Axiomatizing Weak Simulation Semantics over BCCSP
"... This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over the language BCCSP induced from internal steps in process behaviours. In particular, the article focuses on the (pre)congruences associated with the weak simulation, the weak complete simulation and ..."
Abstract
 Add to MetaCart
(Show Context)
This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over the language BCCSP induced from internal steps in process behaviours. In particular, the article focuses on the (pre)congruences associated with the weak simulation, the weak complete simulation and the weak ready simulation preorders. For each of these behavioural semantics, results on the (non)existence of finite (ground)complete (in)equational axiomatizations are given. The axiomatization of those semantics using conditional equations is also discussed in some detail.
Under consideration for publication in Math. Struct. in Comp. Science Proving the validity of equations in GSOS languages using rulematching bisimilarity
, 2010
"... This paper presents a bisimulationbased method for establishing the soundness of equations between terms constructed using operations whose semantics is specified by rules in the GSOS format of Bloom, Istrail and Meyer. The method is inspired by de Simone’s FHbisimilarity and uses transition rules ..."
Abstract
 Add to MetaCart
This paper presents a bisimulationbased method for establishing the soundness of equations between terms constructed using operations whose semantics is specified by rules in the GSOS format of Bloom, Istrail and Meyer. The method is inspired by de Simone’s FHbisimilarity and uses transition rules as schematic transitions in a bisimulationlike relation between open terms. The soundness of the method is proven and examples showing its applicability are provided. The proposed bisimulationbased proof method is incomplete, but the article offers some completeness results for restricted classes of GSOS specifications. An extension of the proof method to the setting of GSOS languages with predicates is also offered. 1.
Composition ⋆
, 909
"... Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS ..."
Abstract
 Add to MetaCart
(Show Context)
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS