A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Instantiation for Parameterised Boolean Equation Systems
[chapter]

2008
*
Lecture Notes in Computer Science
*

In this thesis we will discuss research which is conducted on techniques to

doi:10.1007/978-3-540-85762-4_30
fatcat:ovnzcjey7fa5tk2m4lf6ixrteq
*instantiate**parameterised**boolean**equation**systems*(PBESs), which are part of the mCRL2-toolset. ... This approach leads to a*boolean**equation**system*(BES), which can be solved using BES-solving techniques like gauß elimination. ...*boolean**equation**systems*10 4.1*Boolean**equation**systems*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 5*Instantiation*of*parameterised**boolean**equation**systems*13 5.1 Researched ...##
###
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games

2012
*
Electronic Proceedings in Theoretical Computer Science
*

*Parameterised*

*Boolean*

*Equation*

*Systems*(PBESs) are sequences of

*Boolean*fixed point

*equations*with data variables, used

*for*, e.g., verification of modal mu-calculus formulae

*for*process algebraic specifications ... We enhance the

*instantiation*in two steps. First, we transform the PBES to a

*Parameterised*Parity Game (PPG), a PBES with each

*equation*either conjunctive or disjunctive. ... Conclusions We have defined PPG as normal form

*for*PBESs and a transformation to PPG, making the

*instantiation*to parity games more straightforward. We implemented a PBES language module

*for*LTSMIN. ...

##
###
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems

2011
*
Information and Computation
*

*Parameterised*

*Boolean*

*Equation*

*Systems*Verification problems

*for*finite-and infinite-state processes, like model checking and equivalence checking, can effectively be encoded in

*Parameterised*

*Boolean*

*Equation*... We describe a pragmatic methodology

*for*solving PBESs, viz., by attempting to

*instantiate*them to the sub-fragment of

*Boolean*

*Equation*

*Systems*(BESs). ... We now formalise the notion of a

*Parameterised*

*Boolean*

*Equation*

*System*. Definition 6 (

*Parameterised*

*Boolean*

*Equation*

*System*). ...

##
###
Datalog-Based Program Analysis with BES and RWL
[chapter]

2011
*
Lecture Notes in Computer Science
*

The first technique transforms Datalog programs into an implicit

doi:10.1007/978-3-642-24206-9_1
fatcat:o7y7uiehyrgflhobl2dmdokv64
*Boolean**Equation**System*(Bes) that can then be solved by using linear-time complexity algorithms that are available in existing, general ... This paper describes two techniques*for*Datalog query evaluation and their application to object-oriented program analysis. ... We are grateful to Fernando Tarín and Adam Kepa*for*their valuable contributions to the experiments shown in this paper. ...##
###
Generating and Solving Symbolic Parity Games

2014
*
Electronic Proceedings in Theoretical Computer Science
*

It enhances an existing method, that first encodes the problem to a

doi:10.4204/eptcs.159.2
fatcat:oyzkxkthrjdfpdr7yhxlcjkevy
*Parameterised**Boolean**Equation**System*(PBES) and then*instantiates*the PBES to a parity game. ... We present a new tool*for*verification of modal mu-calculus formulae*for*process specifications, based on symbolic parity games. ... The combination of these tools allows*for*high performance model checking of large*systems*, using MDDs as data structures. ...##
###
Consistent Consequence for Boolean Equation Systems
[chapter]

2012
*
Lecture Notes in Computer Science
*

As an application, we define a novel abstraction mechanism

doi:10.1007/978-3-642-27660-6_23
fatcat:5iru7lntpzdhbiswydwzmvlqh4
*for**parameterised**Boolean**equation**systems*and we establish its correctness using our theory. ... Inspired by the concept of a consistent correlation*for**Boolean**equation**systems*, we introduce and study a novel relation, called consistent consequence. ... Acknowledgements We would like to thank Bas Luttik (TU/e) and Herman Geuvers (Radboud University Nijmegen)*for*their useful comments and suggestions. ...##
###
Typed connector families and their semantics

2017
*
Science of Computer Programming
*

The calculus is based on monoidal categories, with a dependent type

doi:10.1016/j.scico.2017.03.002
fatcat:rgimmwjdxnfvtmsv2qudeub5x4
*system*that describes the*parameterised*interfaces of these connectors. ... Components, connectors, and*systems*are often*parameterised*in such a way that the parameters affect the interfaces. Typing such connector families is challenging. ... Acknowledgements This work is financed by the ERDF -European Regional Development Fund through the Operational Programme*for*Competitiveness and Internationalisation -COMPETE 2020 Programme and by National ...##
###
Using Datalog and Boolean Equation Systems for Program Analysis
[chapter]

2009
*
Lecture Notes in Computer Science
*

This paper describes a powerful, fully automated method to evaluate Datalog queries by using

doi:10.1007/978-3-642-03240-0_18
fatcat:k2crfpceybdx5k3xrgssfpfduy
*Boolean**Equation**Systems*(Bess), and its application to object-oriented program analysis. ... Datalog is used as a specification language*for*expressing complex interprocedural program analyses involving dynamically created objects. ...*Parameterised**Boolean**Equation**System*Given X a set of*boolean*variables and D a set of data terms, a*Parameterised**Boolean**Equation**System*[11] (Pbes) B = (x 0 , M 1 , ..., M n ) is a set of n blocks ...##
###
Static Analysis Techniques for Parameterised Boolean Equation Systems
[chapter]

2009
*
Lecture Notes in Computer Science
*

PBESs are typically solved by symbolic approximation or by

doi:10.1007/978-3-642-00768-2_22
fatcat:lspwrkn6hnbtjfb2xqfbl5sns4
*instantiation*to*Boolean**Equation**Systems*(BESs). ...*Parameterised**Boolean**Equation**Systems*(PBESs) can be used to encode and solve various types of model checking and equivalence checking problems. ...*Parameterised**Boolean**Equation**Systems*(PBESs) have emerged as a versatile framework*for*studying and solving verification problems. ...##
###
Typed Connector Families
[chapter]

2016
*
Lecture Notes in Computer Science
*

The calculus is based on monoidal categories, with a dependent type

doi:10.1007/978-3-319-28934-2_16
fatcat:ddv3huqnnrgexgn4jkd5qsltjm
*system*that describes the*parameterised*interfaces of these connectors. ... Components, connectors, and*systems*are often*parameterised*in such a way that the parameters affect the interfaces. Typing such connector families is challenging. ... Fig. 9 . 9*Equations**for*Connector -replication, choice, and*instantiation*. ...##
###
Parameterised Anonymity
[chapter]

2009
*
Lecture Notes in Computer Science
*

Using recently developed invariant techniques

doi:10.1007/978-3-642-01465-9_12
fatcat:hkhk2spjofdkhljgsdpmmkgquu
*for*solving*parameterised**boolean**equation**systems*, we then show that the Dining Cryptographers protocol guarantees*parameterised*anonymity with respect to ... We use a recently developed theory where standard verification problems like model checking and equivalence checking are encoded as*parameterised**boolean**equation**systems*(PBES) [10] . ...*Parameterised**boolean**equation**systems*(PBES) [10] provide a fundamental framework*for*solving verification problems. ...##
###
Parallel SAT-Based Parameterised Three-Valued Model Checking
[chapter]

2015
*
Lecture Notes in Computer Science
*

Moreover, we introduce a concept

doi:10.1007/978-3-319-23404-5_16
fatcat:3kdwsdggojbmjiveatx4efsgdq
*for*sharing clauses between the instances of parallel SAT-based PMC. ...*Parameterisation*in three-valued model checking (PMC) allows to establish logical connections between unknown parts in state space models. ... The same holds*for*false results*for*all*instantiations*. ...##
###
DATALOG_SOLVE: A Datalog-Based Demand-Driven Program Analyzer

2009
*
Electronical Notes in Theoretical Computer Science
*

After extracting an initial set of Datalog constraints about the Java bytecode program semantics, our framework transforms the Datalog rules of a particular analysis into a

doi:10.1016/j.entcs.2009.07.059
fatcat:dqjstihfcvdqjl7wv4otmpl6jy
*Boolean**Equation**System*(Bes ... Section 3 describes the translation of a demand-driven evaluation of Datalog queries in terms of*boolean**equation**systems*, as well as the tool architecture. ... The front-end of Datalog Solve encodes a set of Datalog rules (a particular analysis) in terms of a*Boolean**Equation**System*(Bes) [3] implicitly described by its successor function. ...##
###
Parameterised Boolean Equation Systems
[chapter]

2004
*
Lecture Notes in Computer Science
*

In previous works [11, 15] it has been outlined how to transform a modal formula and a process, both containing data, to a so-called

doi:10.1007/978-3-540-28644-8_20
fatcat:y3w7wq34hncfrm6weo43i2cw7y
*parameterised**boolean**equation**system*, or*equation**system**for*short. ...*Boolean**equation**system*are a useful tool*for*verifying formulas from modal mu-calculus on transition*systems*(see [18]*for*an excellent treatment). ... important*systems**for*which properties should be provable. ...##
###
Parameterised boolean equation systems

2005
*
Theoretical Computer Science
*

In previous works [11, 15] it has been outlined how to transform a modal formula and a process, both containing data, to a so-called

doi:10.1016/j.tcs.2005.06.016
fatcat:m3imze3ur5dxpdiw3bxyedv5yq
*parameterised**boolean**equation**system*, or*equation**system**for*short. ...*Boolean**equation**system*are a useful tool*for*verifying formulas from modal mu-calculus on transition*systems*(see [18]*for*an excellent treatment). ... important*systems**for*which properties should be provable. ...
« Previous

*Showing results 1 — 15 out of 869 results*