[{"OA_type":"free access","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10906","year":"2012","publication":"Tools and Algorithms for the Construction and Analysis of Systems","article_processing_charge":"No","citation":{"ama":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software verifier based on Horn clauses. In: Flanagan C, König B, eds. <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 7214. LNCS. Berlin, Heidelberg: Springer; 2012:549-551. doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>","ieee":"S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.","ista":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.","apa":"Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., &#38; Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &#38; B. König (Eds.), <i>Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>","short":"S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:, C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.","mla":"Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>.","chicago":"Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>."},"series_title":"LNCS","intvolume":"      7214","abstract":[{"lang":"eng","text":"HSF(C) is a tool that automates verification of safety and liveness properties for C programs. This paper describes the verification approach taken by HSF(C) and provides instructions on how to install and use the tool."}],"author":[{"first_name":"Sergey","last_name":"Grebenshchikov","full_name":"Grebenshchikov, Sergey"},{"full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","first_name":"Ashutosh"},{"first_name":"Nuno P.","full_name":"Lopes, Nuno P.","last_name":"Lopes"},{"first_name":"Corneliu","full_name":"Popeea, Corneliu","last_name":"Popeea"},{"first_name":"Andrey","full_name":"Rybalchenko, Andrey","last_name":"Rybalchenko"}],"publication_status":"published","oa_version":"Published Version","fulldoi":"https://doi.org/10.1007/978-3-642-28756-5_46","date_published":"2012-04-01T00:00:00Z","doi":"10.1007/978-3-642-28756-5_46","conference":{"location":"Tallinn, Estonia","start_date":"2012-03-24","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2012-04-01"},"quality_controlled":"1","das_tickbox":"1","place":"Berlin, Heidelberg","title":"HSF(C): A software verifier based on Horn clauses","date_updated":"2026-07-28T09:23:52Z","day":"01","editor":[{"first_name":"Cormac","full_name":"Flanagan, Cormac","last_name":"Flanagan"},{"full_name":"König, Barbara","last_name":"König","first_name":"Barbara"}],"oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"main_file_link":[{"url":"https://doi.org/10.1007/978-3-642-28756-5_46","open_access":"1"}],"volume":7214,"date_created":"2022-03-21T08:03:30Z","page":"549-551","month":"04","type":"conference","ddc":["000"],"publication_identifier":{"eisbn":["9783642287565"],"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783642287558"]},"publisher":"Springer","alternative_title":["LNCS"],"scopus_import":"1","corr_author":"1"},{"month":"10","type":"conference","acknowledgement":"This work has been financially supported in part by the European Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract # 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008 (Modeling and control of Networked vehicle systems in persistent autonomous operations); by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant QUAREM; and FWF Grant No S11403-N23 (RiSE).","date_created":"2018-12-11T12:00:26Z","page":"43 - 52","language":[{"iso":"eng"}],"arxiv":1,"main_file_link":[{"url":"http://arxiv.org/abs/1207.7019","open_access":"1"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"scopus_import":"1","publisher":"ACM","ec_funded":1,"date_updated":"2026-08-12T14:34:15Z","title":"Finite automata with time delay blocks","oa":1,"day":"01","fulldoi":"https://doi.org/10.1145/2380356.2380370","oa_version":"Preprint","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_published":"2012-10-01T00:00:00Z","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Vinayak","last_name":"Prabhu","full_name":"Prabhu, Vinayak"}],"publication_status":"published","abstract":[{"lang":"eng","text":"The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete. Copyright 2012 ACM."}],"conference":{"end_date":"2012-10-12","location":"Tampere, Finland","start_date":"2012-10-07","name":"EMSOFT: Embedded Software "},"doi":"10.1145/2380356.2380370","quality_controlled":"1","year":"2012","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"2936","citation":{"short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Proceedings of the 10th ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In <i>Proceedings of the 10th ACM International Conference on Embedded Software</i>, 43–52. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>.","mla":"Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” <i>Proceedings of the 10th ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 43–52, doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in <i>Proceedings of the 10th ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 43–52.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2012). Finite automata with time delay blocks. In <i>Proceedings of the 10th ACM international conference on Embedded software</i> (pp. 43–52). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. Proceedings of the 10th ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.","ama":"Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: <i>Proceedings of the 10th ACM International Conference on Embedded Software</i>. ACM; 2012:43-52. doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>"},"external_id":{"arxiv":["1207.7019"]},"article_processing_charge":"No","publication":"Proceedings of the 10th ACM international conference on Embedded software","publist_id":"3799"},{"_id":"531","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","year":"2011","publication":"Formal Methods in System Design","publist_id":"7288","citation":{"short":"R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39 (2011) 297–331.","chicago":"Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of STM on Relaxed Memory Models.” <i>Formal Methods in System Design</i>. Springer, 2011. <a href=\"https://doi.org/10.1007/s10703-011-0131-3\">https://doi.org/10.1007/s10703-011-0131-3</a>.","mla":"Guerraoui, Rachid, et al. “Verification of STM on Relaxed Memory Models.” <i>Formal Methods in System Design</i>, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:<a href=\"https://doi.org/10.1007/s10703-011-0131-3\">10.1007/s10703-011-0131-3</a>.","ieee":"R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed memory models,” <i>Formal Methods in System Design</i>, vol. 39, no. 3. Springer, pp. 297–331, 2011.","ista":"Guerraoui R, Henzinger TA, Singh V. 2011. Verification of STM on relaxed memory models. Formal Methods in System Design. 39(3), 297–331.","apa":"Guerraoui, R., Henzinger, T. A., &#38; Singh, V. (2011). Verification of STM on relaxed memory models. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-011-0131-3\">https://doi.org/10.1007/s10703-011-0131-3</a>","ama":"Guerraoui R, Henzinger TA, Singh V. Verification of STM on relaxed memory models. <i>Formal Methods in System Design</i>. 2011;39(3):297-331. doi:<a href=\"https://doi.org/10.1007/s10703-011-0131-3\">10.1007/s10703-011-0131-3</a>"},"article_processing_charge":"No","external_id":{"isi":["000297596900004"]},"publication_status":"published","issue":"3","author":[{"last_name":"Guerraoui","full_name":"Guerraoui, Rachid","first_name":"Rachid"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Vasu","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh"}],"abstract":[{"text":"Software transactional memories (STM) are described in the literature with assumptions of sequentially consistent program execution and atomicity of high level operations like read, write, and abort. However, in a realistic setting, processors use relaxed memory models to optimize hardware performance. Moreover, the atomicity of operations depends on the underlying hardware. This paper presents the first approach to verify STMs under relaxed memory models with atomicity of 32 bit loads and stores, and read-modify-write operations. We describe RML, a simple language for expressing concurrent programs. We develop a semantics of RML parametrized by a relaxed memory model. We then present our tool, FOIL, which takes as input the RML description of an STM algorithm restricted to two threads and two variables, and the description of a memory model, and automatically determines the locations of fences, which if inserted, ensure the correctness of the restricted STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and McRT STM under the memory models of sequential consistency, total store order, partial store order, and relaxed memory order for two threads and two variables. Finally, we extend the verification results for DSTM and TL2 to an arbitrary number of threads and variables by manually proving that the structural properties of STMs are satisfied at the hardware level of atomicity under the considered relaxed memory models.","lang":"eng"}],"intvolume":"        39","oa_version":"Published Version","fulldoi":"https://doi.org/10.1007/s10703-011-0131-3","date_published":"2011-12-01T00:00:00Z","isi":1,"quality_controlled":"1","doi":"10.1007/s10703-011-0131-3","title":"Verification of STM on relaxed memory models","date_updated":"2025-09-30T09:23:08Z","day":"01","oa":1,"department":[{"_id":"ToHe"}],"main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/178042/files/art3A10.10072Fs10703-011-0131-3.pdf"}],"language":[{"iso":"eng"}],"type":"journal_article","ddc":["000"],"month":"12","page":"297 - 331","date_created":"2018-12-11T11:47:00Z","article_type":"original","volume":39,"publisher":"Springer","corr_author":"1","scopus_import":"1"},{"doi":"10.15479/AT:IST-2011-0005","fulldoi":"https://doi.org/10.15479/AT:IST-2011-0005","date_published":"2011-04-26T00:00:00Z","oa_version":"Published Version","author":[{"first_name":"Thomas","last_name":"Wies","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marco","full_name":"Muñiz, Marco","last_name":"Muñiz"},{"last_name":"Kuncak","full_name":"Kuncak, Viktor","first_name":"Viktor"}],"publication_status":"published","abstract":[{"text":"We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive alternative to more expensive logics such as monadic second-order logic (MSOL) over trees, which have been traditionally used for reasoning about tree data structures.","lang":"eng"}],"citation":{"mla":"Wies, Thomas, et al. <i>On an Efficient Decision Procedure for Imperative Tree Data Structures</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">10.15479/AT:IST-2011-0005</a>.","chicago":"Wies, Thomas, Marco Muñiz, and Viktor Kuncak. <i>On an Efficient Decision Procedure for Imperative Tree Data Structures</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">https://doi.org/10.15479/AT:IST-2011-0005</a>.","short":"T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011.","ieee":"T. Wies, M. Muñiz, and V. Kuncak, <i>On an efficient decision procedure for imperative tree data structures</i>. IST Austria, 2011.","ista":"Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative tree data structures, IST Austria, 25p.","apa":"Wies, T., Muñiz, M., &#38; Kuncak, V. (2011). <i>On an efficient decision procedure for imperative tree data structures</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">https://doi.org/10.15479/AT:IST-2011-0005</a>","ama":"Wies T, Muñiz M, Kuncak V. <i>On an Efficient Decision Procedure for Imperative Tree Data Structures</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">10.15479/AT:IST-2011-0005</a>"},"year":"2011","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5383","file_date_updated":"2020-07-14T12:46:40Z","alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","publisher":"IST Austria","publication_identifier":{"issn":["2664-1690"]},"type":"technical_report","ddc":["000","006"],"month":"04","pubrep_id":"19","page":"25","date_created":"2018-12-12T11:39:01Z","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"file":[{"relation":"main_file","content_type":"application/pdf","checksum":"b20029184c4a819c5f4466a4a3d238b5","file_id":"5462","file_size":619053,"date_created":"2018-12-12T11:53:01Z","access_level":"open_access","date_updated":"2020-07-14T12:46:40Z","creator":"system","file_name":"IST-2011-0005_IST-2011-0005.pdf"}],"oa":1,"day":"26","related_material":{"record":[{"status":"public","id":"3323","relation":"later_version"}]},"date_updated":"2024-10-09T20:54:31Z","title":"On an efficient decision procedure for imperative tree data structures"},{"editor":[{"first_name":"Hongseok","full_name":"Yang, Hongseok","last_name":"Yang"}],"day":"05","date_updated":"2024-10-21T06:03:01Z","title":"Solving recursion-free Horn clauses over LI+UIF","scopus_import":"1","alternative_title":["LNCS"],"publisher":"Springer","ec_funded":1,"month":"12","type":"conference","date_created":"2018-12-11T12:02:20Z","page":"188 - 203","volume":7078,"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"citation":{"ista":"Gupta A, Popeea C, Rybalchenko A. 2011. Solving recursion-free Horn clauses over LI+UIF. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 7078, 188–203.","apa":"Gupta, A., Popeea, C., &#38; Rybalchenko, A. (2011). Solving recursion-free Horn clauses over LI+UIF. In H. Yang (Ed.) (Vol. 7078, pp. 188–203). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan: Springer. <a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">https://doi.org/10.1007/978-3-642-25318-8_16</a>","ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Solving recursion-free Horn clauses over LI+UIF,” presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan, 2011, vol. 7078, pp. 188–203.","mla":"Gupta, Ashutosh, et al. <i>Solving Recursion-Free Horn Clauses over LI+UIF</i>. Edited by Hongseok Yang, vol. 7078, Springer, 2011, pp. 188–203, doi:<a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">10.1007/978-3-642-25318-8_16</a>.","chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Solving Recursion-Free Horn Clauses over LI+UIF.” edited by Hongseok Yang, 7078:188–203. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">https://doi.org/10.1007/978-3-642-25318-8_16</a>.","short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, H. Yang (Ed.), Springer, 2011, pp. 188–203.","ama":"Gupta A, Popeea C, Rybalchenko A. Solving recursion-free Horn clauses over LI+UIF. In: Yang H, ed. Vol 7078. Springer; 2011:188-203. doi:<a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">10.1007/978-3-642-25318-8_16</a>"},"publist_id":"3383","year":"2011","_id":"3264","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","quality_controlled":"1","conference":{"name":"APLAS: Asian Symposium on Programming Languages and Systems","start_date":"2011-12-05","location":"Kenting, Taiwan","end_date":"2011-12-07"},"doi":"10.1007/978-3-642-25318-8_16","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"fulldoi":"https://doi.org/10.1007/978-3-642-25318-8_16","date_published":"2011-12-05T00:00:00Z","oa_version":"None","author":[{"first_name":"Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"last_name":"Popeea","full_name":"Popeea, Corneliu","first_name":"Corneliu"},{"full_name":"Rybalchenko, Andrey","last_name":"Rybalchenko","first_name":"Andrey"}],"publication_status":"published","abstract":[{"text":"Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively au- tomated using abstraction and refinement schemes that rely on spurious counterexamples for abstraction discovery. The analysis of counterexam- ples can be automated by a series of interpolation queries, or, alterna- tively, as a constraint solving query expressed by a set of recursion free Horn clauses. (A set of interpolation queries can be formulated as a single constraint over Horn clauses with linear dependency structure between the unknown relations.) In this paper we present an algorithm for solving recursion free Horn clauses over a combined theory of linear real/rational arithmetic and uninterpreted functions. Our algorithm performs resolu- tion to deal with the clausal structure and relies on partial solutions to deal with (non-local) instances of functionality axioms.","lang":"eng"}],"intvolume":"      7078"},{"fulldoi":"https://doi.org/10.1145/2037509.2037510","date_published":"2011-09-21T00:00:00Z","oa_version":"Submitted Version","author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We introduce propagation models, a formalism designed to support general and efficient data structures for the transient analysis of biochemical reaction networks. We give two use cases for propagation abstract data types: the uniformization method and numerical integration. We also sketch an implementation of a propagation abstract data type, which uses abstraction to approximate states."}],"quality_controlled":"1","conference":{"location":"Paris, France","start_date":"2011-09-21","name":"CMSB: Computational Methods in Systems Biology","end_date":"2011-09-23"},"doi":"10.1145/2037509.2037510","year":"2011","_id":"3299","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Henzinger TA, Mateescu M. Propagation models for computing biochemical reaction networks. In: Springer; 2011:1-3. doi:<a href=\"https://doi.org/10.1145/2037509.2037510\">10.1145/2037509.2037510</a>","ista":"Henzinger TA, Mateescu M. 2011. Propagation models for computing biochemical reaction networks. CMSB: Computational Methods in Systems Biology, 1–3.","ieee":"T. A. Henzinger and M. Mateescu, “Propagation models for computing biochemical reaction networks,” presented at the CMSB: Computational Methods in Systems Biology, Paris, France, 2011, pp. 1–3.","apa":"Henzinger, T. A., &#38; Mateescu, M. (2011). Propagation models for computing biochemical reaction networks (pp. 1–3). Presented at the CMSB: Computational Methods in Systems Biology, Paris, France: Springer. <a href=\"https://doi.org/10.1145/2037509.2037510\">https://doi.org/10.1145/2037509.2037510</a>","chicago":"Henzinger, Thomas A, and Maria Mateescu. “Propagation Models for Computing Biochemical Reaction Networks,” 1–3. Springer, 2011. <a href=\"https://doi.org/10.1145/2037509.2037510\">https://doi.org/10.1145/2037509.2037510</a>.","mla":"Henzinger, Thomas A., and Maria Mateescu. <i>Propagation Models for Computing Biochemical Reaction Networks</i>. Springer, 2011, pp. 1–3, doi:<a href=\"https://doi.org/10.1145/2037509.2037510\">10.1145/2037509.2037510</a>.","short":"T.A. Henzinger, M. Mateescu, in:, Springer, 2011, pp. 1–3."},"publist_id":"3341","ddc":["000","004"],"month":"09","type":"conference","date_created":"2018-12-11T12:02:32Z","page":"1 - 3","pubrep_id":"92","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","file_id":"4649","file_size":255780,"checksum":"7f5c65509db1a9fb049abedd9663ed06","date_updated":"2020-07-14T12:46:06Z","date_created":"2018-12-12T10:07:50Z","access_level":"open_access","file_name":"IST-2012-92-v1+1_Propagation_models_for_computing_biochemical_reaction_networks.pdf","creator":"system"}],"corr_author":"1","file_date_updated":"2020-07-14T12:46:06Z","scopus_import":1,"has_accepted_license":"1","publisher":"Springer","date_updated":"2024-10-09T20:54:34Z","title":"Propagation models for computing biochemical reaction networks","oa":1,"day":"21"},{"abstract":[{"text":"The chemical master equation is a differential equation describing the time evolution of the probability distribution over the possible “states” of a biochemical system. The solution of this equation is of interest within the systems biology field ever since the importance of the molec- ular noise has been acknowledged. Unfortunately, most of the systems do not have analytical solutions, and numerical solutions suffer from the course of dimensionality and therefore need to be approximated. Here, we introduce the concept of tail approximation, which retrieves an approximation of the probabilities in the tail of a distribution from the total probability of the tail and its conditional expectation. This approximation method can then be used to numerically compute the solution of the chemical master equation on a subset of the state space, thus fighting the explosion of the state space, for which this problem is renowned.","lang":"eng"}],"file":[{"access_level":"open_access","date_created":"2018-12-12T10:18:12Z","date_updated":"2020-07-14T12:46:06Z","creator":"system","file_name":"IST-2012-91-v1+1_Tail_approximation_for_the_chemical_master_equation.pdf","relation":"main_file","content_type":"application/pdf","checksum":"aa4d7a832a5419e6c0090650ebff2b9a","file_id":"5331","file_size":240820}],"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"author":[{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Mateescu","full_name":"Mateescu, Maria","first_name":"Maria"}],"publication_status":"published","pubrep_id":"91","date_created":"2018-12-11T12:02:33Z","date_published":"2011-01-01T00:00:00Z","oa_version":"Submitted Version","type":"conference","ddc":["005","570"],"month":"01","conference":{"name":"WCSB: Workshop on Computational Systems Biology (TICSP)"},"quality_controlled":"1","publisher":"Tampere International Center for Signal Processing","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:06Z","corr_author":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Tail approximation for the chemical master equation","_id":"3301","year":"2011","date_updated":"2024-10-09T20:54:34Z","publist_id":"3339","day":"01","citation":{"ama":"Henzinger TA, Mateescu M. Tail approximation for the chemical master equation. In: Tampere International Center for Signal Processing; 2011.","mla":"Henzinger, Thomas A., and Maria Mateescu. <i>Tail Approximation for the Chemical Master Equation</i>. Tampere International Center for Signal Processing, 2011.","chicago":"Henzinger, Thomas A, and Maria Mateescu. “Tail Approximation for the Chemical Master Equation.” Tampere International Center for Signal Processing, 2011.","short":"T.A. Henzinger, M. Mateescu, in:, Tampere International Center for Signal Processing, 2011.","ista":"Henzinger TA, Mateescu M. 2011. Tail approximation for the chemical master equation. WCSB: Workshop on Computational Systems Biology (TICSP).","ieee":"T. A. Henzinger and M. Mateescu, “Tail approximation for the chemical master equation,” presented at the WCSB: Workshop on Computational Systems Biology (TICSP), 2011.","apa":"Henzinger, T. A., &#38; Mateescu, M. (2011). Tail approximation for the chemical master equation. Presented at the WCSB: Workshop on Computational Systems Biology (TICSP), Tampere International Center for Signal Processing."},"oa":1},{"month":"07","type":"conference","ddc":["000"],"date_created":"2018-12-11T12:02:38Z","page":"176 - 185","main_file_link":[{"url":"https://openlib.tugraz.at/download.php?id=5cb57c8a49344&location=browse","open_access":"1"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"scopus_import":"1","publisher":"IEEE","ec_funded":1,"date_updated":"2026-06-18T18:43:15Z","title":"Specification-centered robustness","oa":1,"day":"14","oa_version":"Published Version","fulldoi":"https://doi.org/10.1109/SIES.2011.5953660","date_published":"2011-07-14T00:00:00Z","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"author":[{"first_name":"Roderick","full_name":"Bloem, Roderick","last_name":"Bloem"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Karin","full_name":"Greimel, Karin","last_name":"Greimel"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"}],"publication_status":"published","abstract":[{"text":"In addition to being correct, a system should be robust, that is, it should behave reasonably even after receiving unexpected inputs. In this paper, we summarize two formal notions of robustness that we have introduced previously for reactive systems. One of the notions is based on assigning costs for failures on a user-provided notion of incorrect transitions in a specification. Here, we define a system to be robust if a finite number of incorrect inputs does not lead to an infinite number of incorrect outputs. We also give a more refined notion of robustness that aims to minimize the ratio of output failures to input failures. The second notion is aimed at liveness. In contrast to the previous notion, it has no concept of recovery from an error. Instead, it compares the ratio of the number of liveness constraints that the system violates to the number of liveness constraints that the environment violates.","lang":"eng"}],"quality_controlled":"1","conference":{"end_date":"2011-06-17","location":"Vasteras, Sweden","name":"SIES: International Symposium on Industrial Embedded Systems","start_date":"2011-06-15"},"doi":"10.1109/SIES.2011.5953660","year":"2011","_id":"3316","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–185.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.” In <i>6th IEEE International Symposium on Industrial and Embedded Systems</i>, 176–85. IEEE, 2011. <a href=\"https://doi.org/10.1109/SIES.2011.5953660\">https://doi.org/10.1109/SIES.2011.5953660</a>.","mla":"Bloem, Roderick, et al. “Specification-Centered Robustness.” <i>6th IEEE International Symposium on Industrial and Embedded Systems</i>, IEEE, 2011, pp. 176–85, doi:<a href=\"https://doi.org/10.1109/SIES.2011.5953660\">10.1109/SIES.2011.5953660</a>.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems. SIES: International Symposium on Industrial Embedded Systems, 176–185.","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &#38; Jobstmann, B. (2011). Specification-centered robustness. In <i>6th IEEE International Symposium on Industrial and Embedded Systems</i> (pp. 176–185). Vasteras, Sweden: IEEE. <a href=\"https://doi.org/10.1109/SIES.2011.5953660\">https://doi.org/10.1109/SIES.2011.5953660</a>","ieee":"R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered robustness,” in <i>6th IEEE International Symposium on Industrial and Embedded Systems</i>, Vasteras, Sweden, 2011, pp. 176–185.","ama":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Specification-centered robustness. In: <i>6th IEEE International Symposium on Industrial and Embedded Systems</i>. IEEE; 2011:176-185. doi:<a href=\"https://doi.org/10.1109/SIES.2011.5953660\">10.1109/SIES.2011.5953660</a>"},"article_processing_charge":"No","publication":"6th IEEE International Symposium on Industrial and Embedded Systems","publist_id":"3323"},{"related_material":{"record":[{"status":"public","id":"5383","relation":"earlier_version"}]},"day":"19","date_updated":"2024-10-09T20:54:31Z","title":"An efficient decision procedure for imperative tree data structures","alternative_title":["LNAI "],"scopus_import":1,"corr_author":"1","publisher":"Springer","volume":6803,"date_created":"2018-12-11T12:02:40Z","page":"476 - 491","type":"conference","month":"07","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"citation":{"short":"T. Wies, M. Muñiz, V. Kuncak, in:, Springer, 2011, pp. 476–491.","chicago":"Wies, Thomas, Marco Muñiz, and Viktor Kuncak. “An Efficient Decision Procedure for Imperative Tree Data Structures,” 6803:476–91. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22438-6_36\">https://doi.org/10.1007/978-3-642-22438-6_36</a>.","mla":"Wies, Thomas, et al. <i>An Efficient Decision Procedure for Imperative Tree Data Structures</i>. Vol. 6803, Springer, 2011, pp. 476–91, doi:<a href=\"https://doi.org/10.1007/978-3-642-22438-6_36\">10.1007/978-3-642-22438-6_36</a>.","ista":"Wies T, Muñiz M, Kuncak V. 2011. An efficient decision procedure for imperative tree data structures. CADE 23: Automated Deduction , LNAI , vol. 6803, 476–491.","ieee":"T. Wies, M. Muñiz, and V. Kuncak, “An efficient decision procedure for imperative tree data structures,” presented at the CADE 23: Automated Deduction , Wrocław, Poland, 2011, vol. 6803, pp. 476–491.","apa":"Wies, T., Muñiz, M., &#38; Kuncak, V. (2011). An efficient decision procedure for imperative tree data structures (Vol. 6803, pp. 476–491). Presented at the CADE 23: Automated Deduction , Wrocław, Poland: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22438-6_36\">https://doi.org/10.1007/978-3-642-22438-6_36</a>","ama":"Wies T, Muñiz M, Kuncak V. An efficient decision procedure for imperative tree data structures. In: Vol 6803. Springer; 2011:476-491. doi:<a href=\"https://doi.org/10.1007/978-3-642-22438-6_36\">10.1007/978-3-642-22438-6_36</a>"},"publist_id":"3312","year":"2011","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"3323","doi":"10.1007/978-3-642-22438-6_36","conference":{"name":"CADE 23: Automated Deduction ","start_date":"2011-07-31","location":"Wrocław, Poland","end_date":"2011-08-05"},"quality_controlled":"1","date_published":"2011-07-19T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-642-22438-6_36","oa_version":"None","abstract":[{"lang":"eng","text":"We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive alternative to more expensive logics such as monadic second-order logic (MSOL) over trees, which have been traditionally used for reasoning about tree data structures."}],"intvolume":"      6803","author":[{"last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","first_name":"Thomas"},{"full_name":"Muñiz, Marco","last_name":"Muñiz","first_name":"Marco"},{"full_name":"Kuncak, Viktor","last_name":"Kuncak","first_name":"Viktor"}],"publication_status":"published"},{"title":"Decision procedures for automating termination proofs","date_updated":"2021-01-12T07:42:39Z","editor":[{"first_name":"Ranjit","full_name":"Jhala, Ranjit","last_name":"Jhala"},{"full_name":"Schmidt, David","last_name":"Schmidt","first_name":"David"}],"day":"01","oa":1,"main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/170697/"}],"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"page":"371 - 386","date_created":"2018-12-11T12:02:40Z","volume":6538,"month":"01","type":"conference","publisher":"Springer","alternative_title":["LNCS"],"scopus_import":1,"_id":"3324","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2011","publist_id":"3311","citation":{"ama":"Piskac R, Wies T. Decision procedures for automating termination proofs. In: Jhala R, Schmidt D, eds. Vol 6538. Springer; 2011:371-386. doi:<a href=\"https://doi.org/10.1007/978-3-642-18275-4_26\">10.1007/978-3-642-18275-4_26</a>","short":"R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386.","chicago":"Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.” edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-18275-4_26\">https://doi.org/10.1007/978-3-642-18275-4_26</a>.","mla":"Piskac, Ruzica, and Thomas Wies. <i>Decision Procedures for Automating Termination Proofs</i>. Edited by Ranjit Jhala and David Schmidt, vol. 6538, Springer, 2011, pp. 371–86, doi:<a href=\"https://doi.org/10.1007/978-3-642-18275-4_26\">10.1007/978-3-642-18275-4_26</a>.","ista":"Piskac R, Wies T. 2011. Decision procedures for automating termination proofs. VMCAI: Verification Model Checking and Abstract Interpretation, LNCS, vol. 6538, 371–386.","apa":"Piskac, R., &#38; Wies, T. (2011). Decision procedures for automating termination proofs. In R. Jhala &#38; D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-18275-4_26\">https://doi.org/10.1007/978-3-642-18275-4_26</a>","ieee":"R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386."},"abstract":[{"text":"Automated termination provers often use the following schema to prove that a program terminates: construct a relational abstraction of the program's transition relation and then show that the relational abstraction is well-founded. The focus of current tools has been on developing sophisticated techniques for constructing the abstractions while relying on known decidable logics (such as linear arithmetic) to express them. We believe we can significantly increase the class of programs that are amenable to automated termination proofs by identifying more expressive decidable logics for reasoning about well-founded relations. We therefore present a new decision procedure for reasoning about multiset orderings, which are among the most powerful orderings used to prove termination. We show that, using our decision procedure, one can automatically prove termination of natural abstractions of programs.","lang":"eng"}],"intvolume":"      6538","author":[{"full_name":"Piskac, Ruzica","last_name":"Piskac","first_name":"Ruzica"},{"last_name":"Wies","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"}],"publication_status":"published","date_published":"2011-01-01T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-642-18275-4_26","oa_version":"Submitted Version","quality_controlled":"1","conference":{"end_date":"2011-01-25","location":"Texas, USA","name":"VMCAI: Verification Model Checking and Abstract Interpretation","start_date":"2011-01-23"},"doi":"10.1007/978-3-642-18275-4_26"},{"publisher":"ACM","scopus_import":"1","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:02:41Z","page":"599 - 610","volume":46,"month":"01","type":"conference","day":"26","title":"Streaming transducers for algorithmic verification of single pass list processing programs","date_updated":"2025-09-30T09:10:38Z","quality_controlled":"1","conference":{"end_date":"2011-01-28","name":"POPL: Principles of Programming Languages","start_date":"2011-01-26","location":"Texas, USA"},"doi":"10.1145/1926385.1926454","intvolume":"        46","abstract":[{"text":"We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) sequences of data values, tagged with symbols from a finite set, over a potentially infinite data do- main that supports only the operations of equality and ordering. The transducer uses a finite set of states, a finite set of variables ranging over the data domain, and a finite set of variables ranging over data strings. At every step, it can make decisions based on the next in- put symbol, updating its state, remembering the input data value in its data variables, and updating data-string variables by concatenat- ing data-string variables and new symbols formed from data vari- ables, while avoiding duplication. We establish that the problems of checking functional equivalence of two streaming transducers, and of checking whether a streaming transducer satisfies pre/post verification conditions specified by streaming acceptors over in- put/output data-strings, are in PSPACE. We identify a class of imperative and a class of functional pro- grams, manipulating lists of data items, which can be effectively translated to streaming data-string transducers. The imperative pro- grams dynamically modify a singly-linked heap by changing next- pointers of heap-nodes and by adding new nodes. The main re- striction specifies how the next-pointers can be used for traversal. We also identify an expressively equivalent fragment of functional programs that traverse a list using syntactically restricted recursive calls. Our results lead to algorithms for assertion checking and for checking functional equivalence of two programs, written possibly in different programming styles, for commonly used routines such as insert, delete, and reverse.","lang":"eng"}],"publication_status":"published","author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"first_name":"Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol"}],"issue":"1","fulldoi":"https://doi.org/10.1145/1926385.1926454","isi":1,"date_published":"2011-01-26T00:00:00Z","oa_version":"None","publist_id":"3310","article_processing_charge":"No","external_id":{"isi":["000289656100050"]},"citation":{"ama":"Alur R, Cerny P. Streaming transducers for algorithmic verification of single pass list processing programs. In: Vol 46. ACM; 2011:599-610. doi:<a href=\"https://doi.org/10.1145/1926385.1926454\">10.1145/1926385.1926454</a>","ieee":"R. Alur and P. Cerny, “Streaming transducers for algorithmic verification of single pass list processing programs,” presented at the POPL: Principles of Programming Languages, Texas, USA, 2011, vol. 46, no. 1, pp. 599–610.","ista":"Alur R, Cerny P. 2011. Streaming transducers for algorithmic verification of single pass list processing programs. POPL: Principles of Programming Languages vol. 46, 599–610.","apa":"Alur, R., &#38; Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM. <a href=\"https://doi.org/10.1145/1926385.1926454\">https://doi.org/10.1145/1926385.1926454</a>","short":"R. Alur, P. Cerny, in:, ACM, 2011, pp. 599–610.","mla":"Alur, Rajeev, and Pavol Cerny. <i>Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs</i>. Vol. 46, no. 1, ACM, 2011, pp. 599–610, doi:<a href=\"https://doi.org/10.1145/1926385.1926454\">10.1145/1926385.1926454</a>.","chicago":"Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs,” 46:599–610. ACM, 2011. <a href=\"https://doi.org/10.1145/1926385.1926454\">https://doi.org/10.1145/1926385.1926454</a>."},"_id":"3325","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2011"},{"publist_id":"3309","citation":{"ama":"Almagor S, Boker U, Kupferman O. What’s decidable about weighted automata. In: Vol 6996. Springer; 2011:482-491. doi:<a href=\"https://doi.org/10.1007/978-3-642-24372-1_37\">10.1007/978-3-642-24372-1_37</a>","short":"S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491.","chicago":"Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata,” 6996:482–91. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24372-1_37\">https://doi.org/10.1007/978-3-642-24372-1_37</a>.","mla":"Almagor, Shaull, et al. <i>What’s Decidable about Weighted Automata</i>. Vol. 6996, Springer, 2011, pp. 482–91, doi:<a href=\"https://doi.org/10.1007/978-3-642-24372-1_37\">10.1007/978-3-642-24372-1_37</a>.","apa":"Almagor, S., Boker, U., &#38; Kupferman, O. (2011). What’s decidable about weighted automata (Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer. <a href=\"https://doi.org/10.1007/978-3-642-24372-1_37\">https://doi.org/10.1007/978-3-642-24372-1_37</a>","ista":"Almagor S, Boker U, Kupferman O. 2011. What’s decidable about weighted automata. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6996, 482–491.","ieee":"S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491."},"article_processing_charge":"No","_id":"3326","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2011","quality_controlled":"1","conference":{"location":"Taipei, Taiwan","start_date":"2011-10-11","name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2011-10-14"},"doi":"10.1007/978-3-642-24372-1_37","publication_status":"published","author":[{"last_name":"Almagor","full_name":"Almagor, Shaull","first_name":"Shaull"},{"first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","last_name":"Boker"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"intvolume":"      6996","abstract":[{"lang":"eng","text":"Weighted automata map input words to numerical values. Ap- plications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing. A weighted au- tomaton is defined with respect to a semiring. For the tropical semiring, the weight of a run is the sum of the weights of the transitions taken along the run, and the value of a word is the minimal weight of an accepting run on it. In the 90’s, Krob studied the decidability of problems on rational series defined with respect to the tropical semiring. Rational series are strongly related to weighted automata, and Krob’s results apply to them. In par- ticular, it follows from Krob’s results that the universality problem (that is, deciding whether the values of all words are below some threshold) is decidable for weighted automata defined with respect to the tropical semir- ing with domain ∪ {∞}, and that the equality problem is undecidable when the domain is ∪ {∞}. In this paper we continue the study of the borders of decidability in weighted automata, describe alternative and direct proofs of the above results, and tighten them further. Unlike the proofs of Krob, which are algebraic in their nature, our proofs stay in the terrain of state machines, and the reduction is from the halting problem of a two-counter machine. This enables us to significantly simplify Krob’s reasoning, make the un- decidability result accessible to the automata-theoretic community, and strengthen it to apply already to a very simple class of automata: all the states are accepting, there are no initial nor final weights, and all the weights on the transitions are from the set {−1, 0, 1}. The fact we work directly with the automata enables us to tighten also the decidability re- sults and to show that the universality problem for weighted automata defined with respect to the tropical semiring with domain ∪ {∞}, and in fact even with domain ≥0 ∪ {∞}, is PSPACE-complete. Our results thus draw a sharper picture about the decidability of decision problems for weighted automata, in both the front of containment vs. universality and the front of the ∪ {∞} vs. the ∪ {∞} domains."}],"fulldoi":"https://doi.org/10.1007/978-3-642-24372-1_37","date_published":"2011-10-14T00:00:00Z","oa_version":"Submitted Version","day":"14","oa":1,"title":"What’s decidable about weighted automata","date_updated":"2025-01-14T12:09:37Z","publisher":"Springer","scopus_import":"1","file_date_updated":"2020-07-14T12:46:07Z","alternative_title":["LNCS"],"has_accepted_license":"1","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"file":[{"relation":"main_file","content_type":"application/pdf","checksum":"a7ca08a2cb1b6925f4c18a3034ae5659","file_id":"7868","file_size":182309,"date_created":"2020-05-19T16:08:32Z","access_level":"open_access","date_updated":"2020-07-14T12:46:07Z","creator":"dernst","file_name":"2011_LNCS_Almagor.pdf"}],"type":"conference","ddc":["000"],"month":"10","date_created":"2018-12-11T12:02:41Z","page":"482 - 491","volume":6996},{"ec_funded":1,"publisher":"ACM","scopus_import":"1","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"volume":54,"page":"72 - 82","date_created":"2018-12-11T12:02:50Z","month":"10","type":"journal_article","day":"01","title":"Biology as reactivity","date_updated":"2025-09-30T09:06:32Z","doi":"10.1145/2001269.2001289","quality_controlled":"1","abstract":[{"lang":"eng","text":"Exploring the connection of biology with reactive systems to better understand living systems."}],"intvolume":"        54","publication_status":"published","issue":"10","author":[{"first_name":"Jasmin","full_name":"Fisher, Jasmin","last_name":"Fisher"},{"last_name":"Harel","full_name":"Harel, David","first_name":"David"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"fulldoi":"https://doi.org/10.1145/2001269.2001289","isi":1,"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"date_published":"2011-10-01T00:00:00Z","oa_version":"None","publist_id":"3267","publication":"Communications of the ACM","external_id":{"isi":["000296022500019"]},"article_processing_charge":"No","citation":{"ama":"Fisher J, Harel D, Henzinger TA. Biology as reactivity. <i>Communications of the ACM</i>. 2011;54(10):72-82. doi:<a href=\"https://doi.org/10.1145/2001269.2001289\">10.1145/2001269.2001289</a>","short":"J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011) 72–82.","chicago":"Fisher, Jasmin, David Harel, and Thomas A Henzinger. “Biology as Reactivity.” <i>Communications of the ACM</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/2001269.2001289\">https://doi.org/10.1145/2001269.2001289</a>.","mla":"Fisher, Jasmin, et al. “Biology as Reactivity.” <i>Communications of the ACM</i>, vol. 54, no. 10, ACM, 2011, pp. 72–82, doi:<a href=\"https://doi.org/10.1145/2001269.2001289\">10.1145/2001269.2001289</a>.","ista":"Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82.","apa":"Fisher, J., Harel, D., &#38; Henzinger, T. A. (2011). Biology as reactivity. <i>Communications of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2001269.2001289\">https://doi.org/10.1145/2001269.2001289</a>","ieee":"J. Fisher, D. Harel, and T. A. Henzinger, “Biology as reactivity,” <i>Communications of the ACM</i>, vol. 54, no. 10. ACM, pp. 72–82, 2011."},"status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"3352","year":"2011"},{"doi":"10.1109/QEST.2011.40","conference":{"end_date":"2011-09-08","location":"Aachen, Germany","start_date":"2011-09-05","name":"QEST: Quantitative Evaluation of Systems"},"quality_controlled":"1","publication_status":"published","author":[{"id":"584C6850-E996-11E9-805B-F01764644770","full_name":"Halalai, Raluca","last_name":"Halalai","first_name":"Raluca"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"last_name":"Singh","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu"}],"abstract":[{"lang":"eng","text":"Byzantine Fault Tolerant (BFT) protocols aim to improve the reliability of distributed systems. They enable systems to tolerate arbitrary failures in a bounded number of nodes. BFT protocols are usually proven correct for certain safety and liveness properties. However, recent studies have shown that the performance of state-of-the-art BFT protocols decreases drastically in the presence of even a single malicious node. This motivates a formal quantitative analysis of BFT protocols to investigate their performance characteristics under different scenarios. We present HyPerf, a new hybrid methodology based on model checking and simulation techniques for evaluating the performance of BFT protocols. We build a transition system corresponding to a BFT protocol and systematically explore the set of behaviors allowed by the protocol. We associate certain timing information with different operations in the protocol, like cryptographic operations and message transmission. After an elaborate state exploration, we use the time information to evaluate the performance characteristics of the protocol using simulation techniques. We integrate our framework in Mace, a tool for building and verifying distributed systems. We evaluate the performance of PBFT using our framework. We describe two different use-cases of our methodology. For the benign operation of the protocol, we use the time information as random variables to compute the probability distribution of the execution times. In the presence of faults, we estimate the worst-case performance of the protocol for various attacks that can be employed by malicious nodes. Our results show the importance of hybrid techniques in systematically analyzing the performance of large-scale systems."}],"oa_version":"Submitted Version","fulldoi":"https://doi.org/10.1109/QEST.2011.40","date_published":"2011-10-13T00:00:00Z","publist_id":"3260","citation":{"ista":"Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264.","ieee":"R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany, 2011, pp. 255–264.","apa":"Halalai, R., Henzinger, T. A., &#38; Singh, V. (2011). Quantitative evaluation of BFT protocols (pp. 255–264). Presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany: IEEE. <a href=\"https://doi.org/10.1109/QEST.2011.40\">https://doi.org/10.1109/QEST.2011.40</a>","chicago":"Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation of BFT Protocols,” 255–64. IEEE, 2011. <a href=\"https://doi.org/10.1109/QEST.2011.40\">https://doi.org/10.1109/QEST.2011.40</a>.","mla":"Halalai, Raluca, et al. <i>Quantitative Evaluation of BFT Protocols</i>. IEEE, 2011, pp. 255–64, doi:<a href=\"https://doi.org/10.1109/QEST.2011.40\">10.1109/QEST.2011.40</a>.","short":"R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.","ama":"Halalai R, Henzinger TA, Singh V. Quantitative evaluation of BFT protocols. In: IEEE; 2011:255-264. doi:<a href=\"https://doi.org/10.1109/QEST.2011.40\">10.1109/QEST.2011.40</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"3355","year":"2011","publisher":"IEEE","scopus_import":1,"file_date_updated":"2020-07-14T12:46:09Z","corr_author":"1","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"file":[{"date_updated":"2020-07-14T12:46:09Z","access_level":"open_access","date_created":"2018-12-12T10:07:49Z","file_name":"IST-2012-84-v1+1_Quantitative_evaluation_of_BFT_protocols.pdf","creator":"system","content_type":"application/pdf","relation":"main_file","file_size":272017,"file_id":"4648","checksum":"4dc8750ab7921f51de992000b13d1b01"}],"type":"conference","ddc":["000","004"],"month":"10","pubrep_id":"84","date_created":"2018-12-11T12:02:51Z","page":"255 - 264","day":"13","oa":1,"title":"Quantitative evaluation of BFT protocols","date_updated":"2024-10-09T20:54:27Z"},{"quality_controlled":"1","conference":{"end_date":"2011-05-31","location":"Tarragona, Spain","name":"LATA: Language and Automata Theory and Applications","start_date":"2011-05-26"},"doi":"10.1007/978-3-642-21254-3_17","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Florian","full_name":"Horn, Florian","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn"}],"publication_status":"published","abstract":[{"text":"We consider two-player graph games whose objectives are request-response condition, i.e conjunctions of conditions of the form \"if a state with property Rq is visited, then later a state with property Rp is visited\". The winner of such games can be decided in EXPTIME and the problem is known to be NP-hard. In this paper, we close this gap by showing that this problem is, in fact, EXPTIME-complete. We show that the problem becomes PSPACE-complete if we only consider games played on DAGs, and NP-complete or PTIME-complete if there is only one player (depending on whether he wants to enforce or spoil the request-response condition). We also present near-optimal bounds on the memory needed to design winning strategies for each player, in each case.","lang":"eng"}],"intvolume":"      6638","date_published":"2011-01-01T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-642-21254-3_17","oa_version":"None","publist_id":"3258","citation":{"ama":"Chatterjee K, Henzinger TA, Horn F. The complexity of request-response games. In: Dediu A-H, Inenaga S, Martín-Vide C, eds. Vol 6638. Springer; 2011:227-237. doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">10.1007/978-3-642-21254-3_17</a>","short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">https://doi.org/10.1007/978-3-642-21254-3_17</a>.","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Request-Response Games</i>. Edited by Adrian-Horia Dediu et al., vol. 6638, Springer, 2011, pp. 227–37, doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">10.1007/978-3-642-21254-3_17</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, &#38; C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">https://doi.org/10.1007/978-3-642-21254-3_17</a>","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.","ista":"Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237."},"_id":"3357","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2011","publisher":"Springer","corr_author":"1","scopus_import":1,"alternative_title":["LNCS"],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"type":"conference","month":"01","page":"227 - 237","date_created":"2018-12-11T12:02:52Z","volume":6638,"editor":[{"first_name":"Adrian-Horia","full_name":"Dediu, Adrian-Horia","last_name":"Dediu"},{"first_name":"Shunsuke","last_name":"Inenaga","full_name":"Inenaga, Shunsuke"},{"first_name":"Carlos","last_name":"Martín-Vide","full_name":"Martín-Vide, Carlos"}],"day":"01","title":"The complexity of request-response games","date_updated":"2024-10-09T20:54:27Z"},{"author":[{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu","first_name":"Vasu"},{"first_name":"Thomas","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies"},{"last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","first_name":"Damien","orcid":"0000-0002-3197-8736"}],"publication_status":"published","abstract":[{"text":"The static scheduling problem often arises as a fundamental problem in real-time systems and grid computing. We consider the problem of statically scheduling a large job expressed as a task graph on a large number of computing nodes, such as a data center. This paper solves the large-scale static scheduling problem using abstraction refinement, a technique commonly used in formal verification to efficiently solve computationally hard problems. A scheduler based on abstraction refinement first attempts to solve the scheduling problem with abstract representations of the job and the computing resources. As abstract representations are generally small, the scheduling can be done reasonably fast. If the obtained schedule does not meet specified quality conditions (like data center utilization or schedule makespan) then the scheduler refines the job and data center abstractions and, again solves the scheduling problem. We develop different schedulers based on abstraction refinement. We implemented these schedulers and used them to schedule task graphs from various computing domains on simulated data centers with realistic topologies. We compared the speed of scheduling and the quality of the produced schedules with our abstraction refinement schedulers against a baseline scheduler that does not use any abstraction. We conclude that abstraction refinement techniques give a significant speed-up compared to traditional static scheduling heuristics, at a reasonable cost in the quality of the produced schedules. We further used our static schedulers in an actual system that we deployed on Amazon EC2 and compared it against the Hadoop dynamic scheduler for large MapReduce jobs. Our experiments indicate that there is great potential for static scheduling techniques.","lang":"eng"}],"fulldoi":"https://doi.org/10.1145/1966445.1966476","oa_version":"Published Version","date_published":"2011-04-10T00:00:00Z","conference":{"location":"Salzburg, Austria","name":"EuroSys","start_date":"2011-04-10","end_date":"2011-04-13"},"doi":"10.1145/1966445.1966476","quality_controlled":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3358","year":"2011","publist_id":"3257","citation":{"ama":"Henzinger TA, Singh V, Wies T, Zufferey D. Scheduling large jobs by abstraction refinement. In: ACM; 2011:329-342. doi:<a href=\"https://doi.org/10.1145/1966445.1966476\">10.1145/1966445.1966476</a>","ista":"Henzinger TA, Singh V, Wies T, Zufferey D. 2011. Scheduling large jobs by abstraction refinement. EuroSys, 329–342.","ieee":"T. A. Henzinger, V. Singh, T. Wies, and D. Zufferey, “Scheduling large jobs by abstraction refinement,” presented at the EuroSys, Salzburg, Austria, 2011, pp. 329–342.","apa":"Henzinger, T. A., Singh, V., Wies, T., &#38; Zufferey, D. (2011). Scheduling large jobs by abstraction refinement (pp. 329–342). Presented at the EuroSys, Salzburg, Austria: ACM. <a href=\"https://doi.org/10.1145/1966445.1966476\">https://doi.org/10.1145/1966445.1966476</a>","short":"T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.","chicago":"Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling Large Jobs by Abstraction Refinement,” 329–42. ACM, 2011. <a href=\"https://doi.org/10.1145/1966445.1966476\">https://doi.org/10.1145/1966445.1966476</a>.","mla":"Henzinger, Thomas A., et al. <i>Scheduling Large Jobs by Abstraction Refinement</i>. ACM, 2011, pp. 329–42, doi:<a href=\"https://doi.org/10.1145/1966445.1966476\">10.1145/1966445.1966476</a>."},"article_processing_charge":"No","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://cs.nyu.edu/wies/publ/scheduling_large_jobs_by_abstraction_refinement.pdf"}],"department":[{"_id":"ToHe"}],"month":"04","ddc":["000"],"type":"conference","date_created":"2018-12-11T12:02:53Z","page":"329 - 342","publisher":"ACM","scopus_import":"1","corr_author":"1","title":"Scheduling large jobs by abstraction refinement","date_updated":"2026-06-18T18:44:21Z","day":"10","oa":1},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","title":"From boolean to quantitative synthesis","_id":"3359","year":"2011","date_updated":"2024-10-21T06:03:04Z","publist_id":"3256","day":"09","citation":{"chicago":"Cerny, Pavol, and Thomas A Henzinger. “From Boolean to Quantitative Synthesis,” 149–54. ACM, 2011. <a href=\"https://doi.org/10.1145/2038642.2038666\">https://doi.org/10.1145/2038642.2038666</a>.","mla":"Cerny, Pavol, and Thomas A. Henzinger. <i>From Boolean to Quantitative Synthesis</i>. ACM, 2011, pp. 149–54, doi:<a href=\"https://doi.org/10.1145/2038642.2038666\">10.1145/2038642.2038666</a>.","short":"P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.","apa":"Cerny, P., &#38; Henzinger, T. A. (2011). From boolean to quantitative synthesis (pp. 149–154). Presented at the EMSOFT: Embedded Software , Taipei; Taiwan: ACM. <a href=\"https://doi.org/10.1145/2038642.2038666\">https://doi.org/10.1145/2038642.2038666</a>","ista":"Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.","ieee":"P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154.","ama":"Cerny P, Henzinger TA. From boolean to quantitative synthesis. In: ACM; 2011:149-154. doi:<a href=\"https://doi.org/10.1145/2038642.2038666\">10.1145/2038642.2038666</a>"},"abstract":[{"lang":"eng","text":"Motivated by improvements in constraint-solving technology and by the increase of routinely available computational power, partial-program synthesis is emerging as an effective approach for increasing programmer productivity. The goal of the approach is to allow the programmer to specify a part of her intent imperatively (that is, give a partial program) and a part of her intent declaratively, by specifying which conditions need to be achieved or maintained. The task of the synthesizer is to construct a program that satisfies the specification. As an example, consider a partial program where threads access shared data without using any synchronization mechanism, and a declarative specification that excludes data races and deadlocks. The task of the synthesizer is then to place locks into the program code in order for the program to meet the specification.\r\n\r\nIn this paper, we argue that quantitative objectives are needed in partial-program synthesis in order to produce higher-quality programs, while enabling simpler specifications. Returning to the example, the synthesizer could construct a naive solution that uses one global lock for shared data. This can be prevented either by constraining the solution space further (which is error-prone and partly defeats the point of synthesis), or by optimizing a quantitative objective that models performance. Other quantitative notions useful in synthesis include fault tolerance, robustness, resource (memory, power) consumption, and information flow."}],"language":[{"iso":"eng"}],"publication_status":"published","author":[{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"department":[{"_id":"ToHe"}],"acknowledgement":"This work was partially supported by the ERC Advanced Grant QUAREM, the FWF NFN Grant S11402-N23 (RiSE), and the EU NOE Grant ArtistDesign.","date_created":"2018-12-11T12:02:53Z","page":"149 - 154","oa_version":"None","fulldoi":"https://doi.org/10.1145/2038642.2038666","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems"}],"date_published":"2011-10-09T00:00:00Z","type":"conference","month":"10","doi":"10.1145/2038642.2038666","conference":{"location":"Taipei; Taiwan","name":"EMSOFT: Embedded Software ","start_date":"2011-10-09","end_date":"2011-10-14"},"ec_funded":1,"quality_controlled":"1","publisher":"ACM","scopus_import":"1","corr_author":"1"},{"alternative_title":["LIPIcs"],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:10Z","scopus_import":1,"ec_funded":1,"publisher":"Springer","volume":12,"pubrep_id":"82","date_created":"2018-12-11T12:02:53Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","page":"82 - 96","type":"conference","ddc":["004"],"month":"08","file":[{"date_updated":"2020-07-14T12:46:10Z","date_created":"2018-12-12T10:10:17Z","access_level":"open_access","file_name":"IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf","creator":"system","content_type":"application/pdf","relation":"main_file","file_id":"4803","file_size":504270,"checksum":"250603c6be8ccad4fbd4d7b24221f0ee"}],"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"oa":1,"day":"31","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"date_updated":"2021-01-12T07:42:56Z","title":"Determinizing discounted-sum automata","doi":"10.4230/LIPIcs.CSL.2011.82","conference":{"end_date":"2011-09-15","location":"Bergen, Norway","start_date":"2011-09-12","name":"CSL: Computer Science Logic"},"quality_controlled":"1","fulldoi":"https://doi.org/10.4230/LIPIcs.CSL.2011.82","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems"}],"oa_version":"Published Version","date_published":"2011-08-31T00:00:00Z","intvolume":"        12","abstract":[{"text":"A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, which values a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by lambda^i, where the discount factor lambda is a fixed rational number greater than 1. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, which reflects the assumption that earlier weights are more important than later weights. Determinizing automata is often essential, for example, in formal verification, where there are polynomial algorithms for comparing two deterministic NDAs, while the equivalence problem for NDAs is not known to be decidable. Unfortunately, however, discounted-sum automata are, in general, not determinizable: it is currently known that for every rational discount factor 1 &lt; lambda &lt; 2, there is an NDA with lambda (denoted lambda-NDA) that cannot be determinized. We provide positive news, showing that every NDA with an integral factor is determinizable. We also complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: we show that for every non-integral rational factor lambda, there is a nondeterminizable lambda-NDA. Finally, we prove that the class of NDAs with integral discount factors enjoys closure under the algebraic operations min, max, addition, and subtraction, which is not the case for general NDAs nor for deterministic NDAs. This shows that for integral discount factors, the class of NDAs forms an attractive specification formalism in quantitative formal verification. All our results hold equally for automata over finite words and for automata over infinite words. ","lang":"eng"}],"publication_status":"published","author":[{"first_name":"Udi","last_name":"Boker","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724"}],"citation":{"ista":"Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.","ieee":"U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.","apa":"Boker, U., &#38; Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">https://doi.org/10.4230/LIPIcs.CSL.2011.82</a>","mla":"Boker, Udi, and Thomas A. Henzinger. <i>Determinizing Discounted-Sum Automata</i>. Vol. 12, Springer, 2011, pp. 82–96, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">10.4230/LIPIcs.CSL.2011.82</a>.","chicago":"Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,” 12:82–96. Springer, 2011. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">https://doi.org/10.4230/LIPIcs.CSL.2011.82</a>.","short":"U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.","ama":"Boker U, Henzinger TA. Determinizing discounted-sum automata. In: Vol 12. Springer; 2011:82-96. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">10.4230/LIPIcs.CSL.2011.82</a>"},"publist_id":"3255","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"3360"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","_id":"3361","year":"2011","publist_id":"3254","citation":{"chicago":"Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,” 205–17. IEEE, 2011. <a href=\"https://doi.org/10.1109/CSF.2011.21\">https://doi.org/10.1109/CSF.2011.21</a>.","mla":"Cerny, Pavol, et al. <i>The Complexity of Quantitative Information Flow Problems</i>. IEEE, 2011, pp. 205–17, doi:<a href=\"https://doi.org/10.1109/CSF.2011.21\">10.1109/CSF.2011.21</a>.","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.","ista":"Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.","apa":"Cerny, P., Chatterjee, K., &#38; Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. <a href=\"https://doi.org/10.1109/CSF.2011.21\">https://doi.org/10.1109/CSF.2011.21</a>","ieee":"P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.","ama":"Cerny P, Chatterjee K, Henzinger TA. The complexity of quantitative information flow problems. In: IEEE; 2011:205-217. doi:<a href=\"https://doi.org/10.1109/CSF.2011.21\">10.1109/CSF.2011.21</a>"},"external_id":{"isi":["000300766400014"]},"article_processing_charge":"No","publication_status":"published","author":[{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"abstract":[{"text":"In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (based on Shannon entropy)have been introduced to enable more fine-grained reasoning about programs in situations where limited information flow is acceptable. The QIF bounding problem asks whether the information flow in a given program is bounded by a constant $d$. Our first result is that the QIF bounding problem is PSPACE-complete. The QIF memoryless synthesis problem asks whether it is possible to resolve nondeterministic choices in a given partial program in such a way that in the resulting deterministic program, the quantitative information flow is bounded by a given constant $d$. Our second result is that the QIF memoryless synthesis problem is also EXPTIME-complete. The QIF memoryless synthesis problem generalizes to QIF general synthesis problem which does not impose the memoryless requirement (that is, by allowing the synthesized program to have more variables then the original partial program). Our third result is that the QIF general synthesis problem is EXPTIME-hard.","lang":"eng"}],"fulldoi":"https://doi.org/10.1109/CSF.2011.21","date_published":"2011-06-27T00:00:00Z","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"isi":1,"oa_version":"Submitted Version","conference":{"end_date":"2011-06-29","start_date":"2011-06-27","name":"CSF: Computer Security Foundations","location":"Cernay-la-Ville, France"},"doi":"10.1109/CSF.2011.21","quality_controlled":"1","title":"The complexity of quantitative information flow problems","date_updated":"2025-09-30T09:04:15Z","day":"27","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file":[{"relation":"main_file","content_type":"application/pdf","checksum":"1a25be0c62459fc7640db88af08ff63a","file_id":"4792","file_size":299069,"date_created":"2018-12-12T10:10:07Z","access_level":"open_access","date_updated":"2020-07-14T12:46:10Z","creator":"system","file_name":"IST-2012-81-v1+1_The_complexity_of_quantitative_information_flow_problems.pdf"}],"ddc":["000","005"],"type":"conference","month":"06","pubrep_id":"81","date_created":"2018-12-11T12:02:54Z","page":"205 - 217","publisher":"IEEE","ec_funded":1,"file_date_updated":"2020-07-14T12:46:10Z","scopus_import":"1","corr_author":"1","has_accepted_license":"1"},{"date_updated":"2021-01-12T07:42:57Z","title":"Dynamic reactive modules","oa":1,"day":"01","type":"conference","ddc":["000"],"month":"01","page":"404 - 418","date_created":"2018-12-11T12:02:54Z","volume":6901,"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"file":[{"file_size":337125,"file_id":"7870","checksum":"6bf2453d8e52e979ddb58d17325bad26","content_type":"application/pdf","relation":"main_file","file_name":"2011_CONCUR_Fisher.pdf","creator":"dernst","date_updated":"2020-07-14T12:46:10Z","date_created":"2020-05-19T16:17:48Z","access_level":"open_access"}],"scopus_import":1,"file_date_updated":"2020-07-14T12:46:10Z","alternative_title":["LNCS"],"has_accepted_license":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ec_funded":1,"year":"2011","_id":"3362","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418.","mla":"Fisher, Jasmin, et al. <i>Dynamic Reactive Modules</i>. Vol. 6901, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">10.1007/978-3-642-23217-6_27</a>.","chicago":"Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, and Moshe Vardi. “Dynamic Reactive Modules,” 6901:404–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">https://doi.org/10.1007/978-3-642-23217-6_27</a>.","apa":"Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., &#38; Vardi, M. (2011). Dynamic reactive modules (Vol. 6901, pp. 404–418). Presented at the CONCUR: Concurrency Theory, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">https://doi.org/10.1007/978-3-642-23217-6_27</a>","ista":"Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. 2011. Dynamic reactive modules. CONCUR: Concurrency Theory, LNCS, vol. 6901, 404–418.","ieee":"J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi, “Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen, Germany, 2011, vol. 6901, pp. 404–418.","ama":"Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. Dynamic reactive modules. In: Vol 6901. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2011:404-418. doi:<a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">10.1007/978-3-642-23217-6_27</a>"},"article_processing_charge":"No","publist_id":"3253","fulldoi":"https://doi.org/10.1007/978-3-642-23217-6_27","date_published":"2011-01-01T00:00:00Z","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","author":[{"last_name":"Fisher","full_name":"Fisher, Jasmin","first_name":"Jasmin"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan"},{"first_name":"Nir","last_name":"Piterman","full_name":"Piterman, Nir"},{"last_name":"Singh","full_name":"Singh, Anmol","first_name":"Anmol"},{"last_name":"Vardi","full_name":"Vardi, Moshe","first_name":"Moshe"}],"publication_status":"published","abstract":[{"text":"State-transition systems communicating by shared variables have been the underlying model of choice for applications of model checking. Such formalisms, however, have difficulty with modeling process creation or death and communication reconfigurability. Here, we introduce “dynamic reactive modules” (DRM), a state-transition modeling formalism that supports dynamic reconfiguration and creation/death of processes. The resulting formalism supports two types of variables, data variables and reference variables. Reference variables enable changing the connectivity between processes and referring to instances of processes. We show how this new formalism supports parallel composition and refinement through trace containment. DRM provide a natural language for modeling (and ultimately reasoning about) biological systems and multiple threads communicating through shared variables.","lang":"eng"}],"intvolume":"      6901","quality_controlled":"1","doi":"10.1007/978-3-642-23217-6_27","conference":{"location":"Aachen, Germany","start_date":"2011-09-06","name":"CONCUR: Concurrency Theory","end_date":"2011-09-09"}}]