Technical systems in logic: questions of formalization and automatic verification

In the paper technical systems with counters are considered as logical models. The questions of formalization in temporal logic and automatic analysis via computational tree transformations are discussed.

[1]  Robert Glück,et al.  A positive supercompiler , 1996, Journal of Functional Programming.

[2]  Valentin F. Turchin,et al.  The concept of a supercompiler , 1986, TOPL.

[3]  Alexei Lisitsa,et al.  Reachability Analysis in Verification via Supercompilation , 2008, Int. J. Found. Comput. Sci..

[4]  Andrei P. Nemytykh,et al.  Cryptographic Protocol Verication via Supercompilation , 2013 .

[5]  Alexei Lisitsa,et al.  Verification as a parameterized testing (experiments with the SCP4 supercompiler) , 2007, Programming and Computer Software.

[6]  Robert Glück,et al.  Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree , 1993, WSA.

[7]  Stéphane Demri,et al.  Model Checking Freeze LTL over One-Counter Automata , 2008, FoSSaCS.

[8]  Morten Heine Sørensen,et al.  On Perfect Supercompilation , 1999, Ershov Memorial Conference.

[9]  Geoff W. Hamilton,et al.  Distillation with labelled transition systems , 2012, PEPM '12.

[10]  Alexei Lisitsa,et al.  Cryptographic Protocol Verification via Supercompilation (A Case Study) , 2013, VPT@CAV.

[11]  A. N. Nepeivoda.  Verification of a technical system model with linear temporal logic , 2012 .

[12]  Robert Glück,et al.  An Algorithm of Generalization in Positive Supercompilation , 1995, ILPS.

[13]  Geoff W. Hamilton,et al.  Extracting the Essence of Distillation , 2009, Ershov Memorial Conference.

[14]  Andrei P. Nemytykh,et al.  The Supercompiler SCP4: General Structure , 2003, Ershov Memorial Conference.

[15]  Andrei V. Klimov,et al.  A Java Supercompiler and Its Application to Verification of Cache-Coherence Protocols , 2009, Ershov Memorial Conference.