Moderne Concurrency Paradigms

Project Period: 2015-03-01 – 2019-08-31
Externally Funded
Acronym
SHINE
Principal Investigator
Thomas A Henzinger
Department(s)
Henzinger Group
Grant Number
S11402-N23
Funding Organisation
FWF

39 Publications

2013 | Conference Paper | IST-REx-ID: 2182
Quantitative abstraction refinement
P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.
View | DOI
 
2014 | Journal Article | IST-REx-ID: 2187   OA
Synthesizing robust systems
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, G. Hofferek, B. Jobstmann, B. Könighofer, R. Könighofer, Acta Informatica 51 (2014) 193–220.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 471   OA
Faster statistical model checking for unbounded temporal properties
P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).
View | Files available | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 647
Conic abstractions for hybrid systems
S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, A. Abate, G. Geeraerts (Eds.), Springer, 2017, pp. 116–132.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1011   OA
Faster algorithms for weighted recursive state machines
K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313.
View | DOI | Download (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2026
Rabinizer 3: Safraless translation of ltl to small deterministic automata
Z. Komárková, J. Kretinsky, in:, F. Cassez, J.-F. Raskin (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 235–241.
View | DOI
 
2011 | Journal Article | IST-REx-ID: 3353   OA
A theory of synchronous relational interfaces
S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011).
View | Files available | DOI
 
2014 | Journal Article | IST-REx-ID: 2038
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014) 27.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 81
Monitoring temporal logic with clock variables
A. Elgyütt, T. Ferrere, T.A. Henzinger, in:, Springer, 2018, pp. 53–70.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 942
S3: Syntax- and semantic-guided repair synthesis via programming by examples
X. Le, D.H. Chu, D. Lo, C. Le Goues, W. Visser, in:, ACM, 2017, pp. 593–604.
View | DOI
 
2017 | Book Chapter | IST-REx-ID: 625   OA
The cost of exactness in quantitative reachability
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1498   OA
The need for language support for fault-tolerant distributed systems
C. Dragoi, T.A. Henzinger, D. Zufferey, 32 (2015) 90–102.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2167
Compositional specifications for ioco testing
P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, in:, IEEE 7th International Conference on Software Testing, Verification and Validation, Springer, 2014.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2181   OA
Quantitative relaxation of concurrent data structures
T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2218   OA
Regression-free synthesis for concurrency
P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2014, pp. 568–584.
View | Files available | DOI | Download (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3362
Dynamic reactive modules
J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi, in:, J.-P. Katoen, B. König (Eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418.
View | DOI
 
2014 | Conference Paper | IST-REx-ID: 475   OA
First cycle games
B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 963   OA
Timed network games with clocks
G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 37.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1116   OA
Computing scores of forwarding schemes in switched networks with probabilistic faults
G. Avni, S. Goel, T.A. Henzinger, G. Rodríguez Navas, in:, Springer, 2017, pp. 169–187.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1541
XSpeed: Accelerating reachability analysis on multi-core processors
R. Ray, A. Gurung, B. Das, E. Bartocci, S. Bogomolov, R. Grosu, 9434 (2015) 3–18.
View | DOI
 
2014 | Conference Paper | IST-REx-ID: 2190   OA
From LTL to deterministic automata: A safraless compositional approach
J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 192–208.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 465
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2063
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1003
An abstraction-refinement methodology for reasoning about network games
G. Avni, S. Guha, O. Kupferman, in:, AAAI Press, 2017, pp. 70–76.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 636   OA
On the quantitative semantics of regular expressions over real-valued signals
A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts (Eds.), Springer, 2017, pp. 189–206.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 631
Counterexample guided refinement of template polyhedra
S. Bogomolov, G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2017, pp. 589–606.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1194   OA
Stochastic invariants for probabilistic termination
K. Chatterjee, P. Novotny, D. Zikelic, in:, ACM, 2017, pp. 145–160.
View | DOI | Download (ext.)
 
2014 | Conference Paper | IST-REx-ID: 1872   OA
Extensional crisis and proving identity
A. Gupta, L. Kovács, B. Kragl, A. Voronkov, in:, F. Cassez, J.-F. Raskin (Eds.), ATVA 2014, Springer, 2014, pp. 185–200.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2053   OA
Probabilistic bisimulation: Naturally on distributions
H. Hermanns, J. Krčál, J. Kretinsky, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–265.
View | DOI | Download (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2027   OA
Verification of markov decision processes using learning algorithms
T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Kretinsky, M. Kwiatkowska, D. Parker, M. Ujma, in:, F. Cassez, J.-F. Raskin (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Society of Industrial and Applied Mathematics, 2014, pp. 98–114.
View | DOI | Download (ext.)
 
2014 | Journal Article | IST-REx-ID: 1733
Interface simulation distances
P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.
View | Files available | DOI | Download (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3359
From boolean to quantitative synthesis
P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3361   OA
The complexity of quantitative information flow problems
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3366
Quantitative synthesis for concurrent programs
P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 549   OA
Causality-based model checking
B. Finkbeiner, A. Kupriyanov, in:, Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2017, pp. 31–38.
View | Files available | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 133
Synchronizing the asynchronous
B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 21.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 140
Space-time interpolants
G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 962
Model counting for recursively-defined strings
M. Trinh, D.H. Chu, J. Jaffar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 399–418.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 633
Challenges and tool implementation of hybrid rapidly exploring random trees
S. Bak, S. Bogomolov, T.A. Henzinger, A. Kumar, in:, A. Abate, S. Bodo (Eds.), Springer, 2017, pp. 83–89.
View | DOI