Wednesday 14 February 2018 photo 4/15
![]() ![]() ![]() |
Counterexample-guided abstraction refinement dblp lijun: >> http://ckg.cloudz.pw/download?file=counterexample-guided+abstraction+refinement+dblp+lijun << (Download)
Counterexample-guided abstraction refinement dblp lijun: >> http://ckg.cloudz.pw/read?file=counterexample-guided+abstraction+refinement+dblp+lijun << (Read Online)
ouaknine name origin
e allen emerson
10 Dec 2017 Rohit Chadha, Mahesh Viswanathan, Ramesh Viswanathan: Least upper bounds for probability measures and their applications to abstractions. . Rohit Chadha, Mahesh Viswanathan: A counterexample-guided abstraction-refinement framework for markov decision processes. ACM Trans. Comput. Log.
Products 1 - 6 of 6 Download Counterexample-guided abstraction refinement dblp lijun: ksh.cloudz.pw/download?file=counterexample-guided+abstraction+refinement+dblp+lijun Read Online Counterexample-guided abstraction refinement dblp lijun:
21 Dec 2017 dblp.org/rec/journals/ijfcs/ClarkeFHKOST03. Edmund M. Clarke, Ansgar Fehnker, Zhi Han, Bruce H. Krogh, Joel Ouaknine, Olaf Stursberg, Michael Theobald: Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems. Int. J. Found. Comput. Sci. 14(4): 583-604 (2003).
List of computer science publications by Edmund M. Clarke.
A complete list of publications can be found on dblp and Google Scholar. In an earlier line of work, Leander Tentrup and I created the QBF solver CAQE, which implements a variant of the counter-example guided abstraction refinement (CEGAR) algorithm [RT15]. It won the first place in the main track of QBFEVAL'17.
Kenji Suzuki, Teruo Higashino, Keiichi Yasumoto, Khaled El-Fakih: Formal Techniques for Networked and Distributed Systems - FORTE 2008, 28th IFIP WG 6.1 International Conference, Tokyo, Japan, June 10-13, 2008, Proceedings. Lecture Notes in Computer Science 5048, Springer 2008, ISBN 978-3-540-68854-9
refine by venue. COMPSAC (4); TASE (3); CAV (3); Comput. J. (2); Int. J. Comput. Math. (2); Mathematical and Computer Modelling (2); ATVA (2); ICECCS (2); ICSE (2); IEEE Trans. Computers (2); IEEE Trans. on Circuits and Systems (1). 22 more options. no options. temporarily not available. [+][–]
21 Dec 2017 Full-Text Paper (PDF) | 10.1145/1838552.1838553 | Oct 1, 2010 | The main challenge in using abstractions effectively is to construct a suitable One approach that tries to address this problem is that of counterexample guided abstraction refinement DOI: 10.1145/1838552.1838553 · Source: DBLP.
1 Jul 2014 Rohit Chadha , Mahesh Viswanathan, A counterexample-guided abstraction-refinement framework for markov decision processes, ACM Transactions on . Lei Song , Lijun Zhang , Holger Hermanns , Jens Chr. Godskesen, Incremental Bisimulation Abstraction Refinement, Proceedings of the 2013 13th
Shing-Chi Cheung, Alessandro Orso, Margaret-Anne D. Storey: Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering, (FSE-22), Hong Kong, China, November 16 - 22, 2014. ACM 2014, ISBN 978-1-4503-3056-5
Annons