NDLI: Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space

Content Provider	IEEE Xplore Digital Library
Author	Bonakdarpour, B. Kulkarni, S.S.
Copyright Year	2007
Description	Author affiliation: Dept. of Comput. Sci. & Eng., Michigan State Univ., East Lansing, MI (Bonakdarpour, B.; Kulkarni, S.S.)
Abstract	Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complexity known as the state explosion problem. Symbolic techniques, in which elements of a problem are represented by Boolean formulae, are desirable in the sense that they often remedy the state explosion problem and time complexity of decision procedures. Although symbolic techniques have successfully been used in program verification, their benefits have not yet been exploited in the context of program synthesis and transformation extensively. In this paper, we present a symbolic method for automatic synthesis of fault-tolerant distributed programs. Our experimental results on synthesis of classical fault-tolerant distributed problems such as Byzantine agreement and token ring show a significant performance improvement by several orders of magnitude in both time and space complexity. To the best of our knowledge, this is the first illustration where programs with large state space (beyond $2^{100})$ is handled during synthesis.
Sponsorship	IEEE Comput. Soc. Tech. Comm. Distributed Process.
Starting Page	3
Ending Page	3
File Size	268563
Page Count	1
File Format	PDF
ISBN	0769528373
ISSN	10636927
DOI	10.1109/ICDCS.2007.109
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-06-25
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	State-space methods Fault tolerance Safety Explosions Automatic control Context modeling Automata Computer science Electronic mail Algorithm design and analysis
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Exploiting symbolic techniques in automated synthesis of distributed programs with large state space (2007)

Software fault tolerance of distributed programs using computation slicing

Exploiting symbolic techniques in automated synthesis of distributed programs (2007)

Constraint Based Automated Synthesis of Nonmasking and Stabilizing Fault-Tolerance

Complexity issues in automated synthesis of failsafe fault-tolerance

Symbolic synthesis of masking fault-tolerant distributed programs

Exploiting symbolic techniques in automated synthesis of distributed programs

Model Checking of Consensus Algorit

Compositional and symbolic model-checking of real-time systems

Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space

Similar Documents

Exploiting symbolic techniques in automated synthesis of distributed programs with large state space (2007)

Software fault tolerance of distributed programs using computation slicing

Exploiting symbolic techniques in automated synthesis of distributed programs (2007)

Constraint Based Automated Synthesis of Nonmasking and Stabilizing Fault-Tolerance

Complexity issues in automated synthesis of failsafe fault-tolerance

Symbolic synthesis of masking fault-tolerant distributed programs

Exploiting symbolic techniques in automated synthesis of distributed programs

Model Checking of Consensus Algorit

Compositional and symbolic model-checking of real-time systems

Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space