Filters








16 Hits in 4.6 sec

Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time

Steffen Smolka, Nate Foster, Justin Hsu, Tobias Kappé, Dexter Kozen, Alexandra Silva
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
Guarded Kleene Algebra with Tests (GKAT) is a variation on Kleene Algebra with Tests (KAT) that arises by restricting the union (+) and iteration (*) operations from KAT to predicate-guarded versions.  ...  In contrast to KAT, whose equational theory is PSPACE-complete, we show that the equational theory of GKAT is (almost) linear time.  ...  We answer this question positively with a comprehensive study of Guarded Kleene Algebra with Tests (GKAT), the guarded fragment of KAT.  ... 
doi:10.1145/3371129 fatcat:xczobnfa35hkjimnfebeujulxe

Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness [article]

Todd Schmid and Tobias Kappé and Dexter Kozen and Alexandra Silva
2021 arXiv   pre-print
Guarded Kleene Algebra with Tests (GKAT) is an efficient fragment of KAT, as it allows for almost linear decidability of equivalence. In this paper, we study the (co)algebraic properties of GKAT.  ...  We then characterize the behaviors of GKAT expressions in this semantics, leading to a coequation that captures the covariety of automata corresponding to behaviors of GKAT expressions.  ...  Guarded Kleene algebra with tests: Verification of uninterpreted programs in nearly linear time. In POPL, 2020. doi:10.1145/3371129. Henning Urbat, Jirí Adámek, Liang-Ting Chen, and Stefan Milius.  ... 
arXiv:2102.08286v2 fatcat:44kcysy6tjbk5fdqpdtf4lrjfa

Model Finding for Recursive Functions in SMT [chapter]

Andrew Reynolds, Jasmin Christian Blanchette, Simon Cruanes, Cesare Tinelli
2016 Lecture Notes in Computer Science  
SMT solvers have recently been extended with techniques for finding models in presence of universally quantified formulas in some restricted fragments.  ...  An empirical evaluation confirms that the approach improves the performance of existing solvers on benchmarks from two sources.  ...  We would also like to thank Damien Busato-Gaston and Emmanouil Koukoutos for providing the initial set of benchmarks used in the evaluation, and the anonymous reviewers for their suggestions and comments  ... 
doi:10.1007/978-3-319-40229-1_10 fatcat:onkr4y3uvjdozgu2abravox65a

Concurrent Kleene Algebra with Observations: from Hypotheses to Completeness [article]

Tobias Kappé and Paul Brunet and Alexandra Silva and Jana Wagemaker and Fabio Zanasi
2020 arXiv   pre-print
It turns out that integrating tests in CKA is subtle, due to their interaction with parallelism. In this paper we provide a solution in the form of Concurrent Kleene Algebra with Observations (CKAO).  ...  Concurrent Kleene Algebra (CKA) extends basic Kleene algebra with a parallel composition operator, which enables reasoning about concurrent programs.  ...  Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time. In POPL, pages 61:1-61:28, 2020. doi:10.1145/3371129. 28.  ... 
arXiv:2002.09682v1 fatcat:uv4z53k755hd7kiubof4ijoazi

Proceedings of the Third Workshop on Formal Integrated Development Environment

Kim G. Larsen
2017 Electronic Proceedings in Theoretical Computer Science  
I have started this work together with ZoltánÉsik when I visited him in Szeged in February 2016. Unfortunately, Zoltán did not live to see it completed.  ...  We would like to put our preliminary results of our proposed approach together and evaluate (1) whether DSE is applicable to SPLs in order to e ciently derive the behavioural changes among di↵erent products  ...  We are working on an algebraic characterization of HReg: using a new notion of indexed semiring, we conjecture that HReg is the free T -indexed Kleene algebra and the free T -indexed ⇤ -continuous Kleene  ... 
doi:10.4204/eptcs.240.0.1 fatcat:imfjolcxmrfm7kqiz523rbyj5i

General Chairman's Message

2006 2006 Proceedings of the First Mobile Computing and Wireless Communication International Conference  
We, thank Todd Grimm and Bruce Labaw for implementing support for our verification method in the SCR toolset.  ...  This work was accomplished under the Rockwell Collins IR&D program.  ...  Theorem proving: verification of the overall program is based upon the verification of the atomic program statements.  ... 
doi:10.1109/mcwc.2006.4375180 fatcat:c4cqrusqb5bcrczqa2fu77zgfu

General Chairman's Message

1986 MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's  
We, thank Todd Grimm and Bruce Labaw for implementing support for our verification method in the SCR toolset.  ...  This work was accomplished under the Rockwell Collins IR&D program.  ...  Theorem proving: verification of the overall program is based upon the verification of the atomic program statements.  ... 
doi:10.1109/milcom.1986.4805724 fatcat:ywopnvuobzd7nfg5vqbicn6wcy

General Chairman's Message

1983 1983 IEEE Symposium on Security and Privacy  
We, thank Todd Grimm and Bruce Labaw for implementing support for our verification method in the SCR toolset.  ...  This work was accomplished under the Rockwell Collins IR&D program.  ...  Theorem proving: verification of the overall program is based upon the verification of the atomic program statements.  ... 
doi:10.1109/sp.1983.10000 fatcat:gwmwca6z6vcs7oo44rri25ie4i

General Chairman's Message

1985 22nd ACM/IEEE Design Automation Conference  
We, thank Todd Grimm and Bruce Labaw for implementing support for our verification method in the SCR toolset.  ...  This work was accomplished under the Rockwell Collins IR&D program.  ...  Theorem proving: verification of the overall program is based upon the verification of the atomic program statements.  ... 
doi:10.1109/dac.1985.1585898 fatcat:qcddxeqjfrgcnkywt4dlol5s2u

General Chairman's Message

1986 MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's  
We, thank Todd Grimm and Bruce Labaw for implementing support for our verification method in the SCR toolset.  ...  This work was accomplished under the Rockwell Collins IR&D program.  ...  Theorem proving: verification of the overall program is based upon the verification of the atomic program statements.  ... 
doi:10.1109/milcom.1986.4805808 fatcat:45cvhs7md5gupdkd4rckkqy3qm

General Chairman's Message

2004 PLANS 2004 Position Location and Navigation Symposium (IEEE Cat No 04CH37556) PLANS-04  
We, thank Todd Grimm and Bruce Labaw for implementing support for our verification method in the SCR toolset.  ...  This work was accomplished under the Rockwell Collins IR&D program.  ...  Theorem proving: verification of the overall program is based upon the verification of the atomic program statements.  ... 
doi:10.1109/plans.2004.1308961 fatcat:jrv2qudaw5e4fm7vtyfx4clip4

General Chairman's Message

1986 MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's  
We, thank Todd Grimm and Bruce Labaw for implementing support for our verification method in the SCR toolset.  ...  This work was accomplished under the Rockwell Collins IR&D program.  ...  Theorem proving: verification of the overall program is based upon the verification of the atomic program statements.  ... 
doi:10.1109/milcom.1986.4805639 fatcat:yv3yt6hivvg4bjtj5ftdxp7dke

General Chairman's Message

1986 23rd ACM/IEEE Design Automation Conference  
We, thank Todd Grimm and Bruce Labaw for implementing support for our verification method in the SCR toolset.  ...  This work was accomplished under the Rockwell Collins IR&D program.  ...  Theorem proving: verification of the overall program is based upon the verification of the atomic program statements.  ... 
doi:10.1109/dac.1986.1586054 fatcat:4wqbpjk4vzfi5hiqypgttzltjq

On Star Expressions and Coalgebraic Completeness Theorems [article]

Todd Schmid, Jurriaan Rot, Alexandra Silva
2021 arXiv   pre-print
One of the main difficulties of the problem is the lack of a full Kleene theorem, since there are automata that can not be specified, up to bisimilarity, by an expression.  ...  This culminates in two abstract proof methods for completeness, what we call the local and global approaches, and a description of when one method can be used in place of the other.  ...  Guarded kleene algebra with tests: Verification of uninterpreted programs in nearly linear time. CoRR, abs/1907.05920, 2019. URL: http://arxiv.org/abs/1907.05920, arXiv:1907.05920.  ... 
arXiv:2106.08074v1 fatcat:quvrvws5j5hsbewby4m7yzphbe

A history of Haskell

Paul Hudak, John Hughes, Simon Peyton Jones, Philip Wadler
2007 Proceedings of the third ACM SIGPLAN conference on History of programming languages - HOPL III  
We would also like to give our particular thanks to Bernie Pope and Don Stewart, who prepared the time-line given in Figure 2 .  ...  Here they are, with their affiliations during the lifetime of the committee, and identifying those who served as Editor for some iteration of the language: Arvind (MIT), Lennart Augustsson (Chalmers University  ...  and linear time.  ... 
doi:10.1145/1238844.1238856 dblp:conf/hopl/HudakHJW07 fatcat:7i7s3ivrkzhotgoyvjnxcjglxu
« Previous Showing results 1 — 15 out of 16 results