A Note on Program Specialization. What Syntactical Properties of Residual Programs Can Reveal?

Lisitsa, Alexei; Nemytykh, Andrei P.

doi:10.29007/cj27

Cited by 4 publications

(3 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Specialization can be used for analysis of other program properties, based on syntactic properties of the corresponding residual program. For example, any program can be seen as encoding a transition system of the parameterized program states and transitions and one may try to apply specialization to improve some properties of the transition graph (see [38]).…”

Section: Introductionmentioning

confidence: 99%

Finite Countermodel Based Verification for Program Transformation (A Case Study)

Lisitsa

Nemytykh

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Both automatic program verification and program transformation are based on program analysis. In the past decade a number of approaches using various automatic general-purpose program transformation techniques (partial deduction, specialization, supercompilation) for verification of unreachability properties of computing systems were introduced and demonstrated [10,19,30,36]. On the other hand, the semantics based unfold-fold program transformation methods pose themselves diverse kinds of reachability tasks and try to solve them, aiming at improving the semantics tree of the program being transformed. That means some general-purpose verification methods may be used for strengthening program transformation techniques. This paper considers the question how finite countermodels for safety verification method [34] might be used in Turchin's supercompilation method. We extract a number of supercompilation sub-algorithms trying to solve reachability problems and demonstrate use of an external model finder for solving some of the problems.

show abstract

Section: Introductionmentioning

confidence: 99%

Finite Countermodel Based Verification for Program Transformation (A Case Study)

Lisitsa

Nemytykh

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…I.e., the property is simpler than the formulated one.Given a safety property required from a protocol, in order to look for witnesses violating the property, the method above can be extended by deriving False by unfolding, using a specializer in an interactive mode. See[31,32,33,39] for examples of bugged protocols and the corresponding witnesses constructed by means of the supercompiler SCP4.…”

mentioning

confidence: 99%

Verification of Programs via Intermediate Interpretation

Lisitsa

Nemytykh

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We explore an approach to verification of programs via program transformation applied to an interpreter of a programming language. A specialization technique known as Turchin's supercompilation is used to specialize some interpreters with respect to the program models. We show that several safety properties of functional programs modeling a class of cache coherence protocols can be proved by a supercompiler and compare the results with our earlier work on direct verification via supercompilation not using intermediate interpretation.Our approach was in part inspired by an earlier work by E. De Angelis et al. ( -2015 where verification via program transformation and intermediate interpretation was studied in the context of specialization of constraint logic programs.

show abstract

“…But program transformations can also be used for analysis of programs [22] and more specifically for their verification [14,19]. In the experiments discussed below we use a specializer based on Turchin's supercompilation method [36,35,32,33,19,4] as the program specialization technique.…”

Section: Introductionmentioning

confidence: 99%

Cryptographic Protocol Verification via Supercompilation (A Case Study)

Ahmed¹,

Lisitsa²,

Nemytykh³

EPiC Series in Computing

Self Cite

View full text Add to dashboard Cite

It has been known for a while [35,36,12] that program transformation techniques, in particular, program specialization, can be used to prove the properties of programs automatically. For example, if a program actually implements (in a given context of use) a constant function sufficiently powerful and semantics preserving program transformation may reduce the program to a syntactically trivial "constant" program, pruning unreachable branches and proving thereby the property. Viability of such an approach to verification has been demonstrated in previous works [16,19,18] where it was applied to the verification of parameterized cache coherence protocols and Petri Nets models [11,20]. In this paper we further extend the method and present a case study on its application to the verification of a cryptographic protocol. The protocol is modeled by functional programs at different levels of abstraction and verification via program specialization is done by using Turchin's supercompilation method.

show abstract

A Note on Program Specialization. What Syntactical Properties of Residual Programs Can Reveal?

Cited by 4 publications

References 26 publications

Finite Countermodel Based Verification for Program Transformation (A Case Study)

Finite Countermodel Based Verification for Program Transformation (A Case Study)

Verification of Programs via Intermediate Interpretation

Cryptographic Protocol Verification via Supercompilation (A Case Study)

Contact Info

Product

Resources

About