Liveness analysis for parameterised Boolean equation systems

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

9 Citaten (Scopus)

Samenvatting

We present a sound static analysis technique for fighting the combinatorial explosion of parameterised Boolean equation systems (PBESs). These essentially are systems of mutually recursive fixed point equations ranging over first-order logic formulae. Our method detects parameters that are not live by analysing a control flow graph of a PBES, and it subsequently eliminates such parameters. We show that a naive approach to constructing a control flow graph, needed for the analysis, may suffer from an exponential blow-up, and we define an approximate analysis that avoids this problem. The effectiveness of our techniques is evaluated using a number of case studies.
Originele taal-2Engels
TitelAutomated Technology for Verification and Analysis (12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014)
RedacteurenF. Cassez, J.-F. Raskin
Plaats van productieBerlin
UitgeverijSpringer
Pagina's219-234
ISBN van geprinte versie978-3-319-11935-9
DOI's
StatusGepubliceerd - 2014
Evenementconference; 12th International Symposium on Automated Technology for Verification and Analysis; 2014-11-03; 2014-11-06 -
Duur: 3 nov. 20146 nov. 2014

Publicatie series

NaamLecture Notes in Computer Science
Volume8837
ISSN van geprinte versie0302-9743

Congres

Congresconference; 12th International Symposium on Automated Technology for Verification and Analysis; 2014-11-03; 2014-11-06
Periode3/11/146/11/14
Ander12th International Symposium on Automated Technology for Verification and Analysis

Vingerafdruk

Duik in de onderzoeksthema's van 'Liveness analysis for parameterised Boolean equation systems'. Samen vormen ze een unieke vingerafdruk.

Citeer dit