[BG11] N. Bertrand, B. Genest. Minimal Disclosure in Partially Observable Markov Decision Processes. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Bombay, Inde, December 2011.
[B11] P. Bhateja. A Tagging Protocol for Asynchronous Testing. In 5th IEEE International Conference on Theoretical Aspects of Software Engineering, August 2011.
[AMJM11] W. L. Andrade, P. D. L. Machado, T. Jéron, H. Marchand. Abstracting Time and Data for Conformance Testing of Real-Time Systems, in "7th Workshop on Advances in Model Based Testing A-MOST 2011", Berlin, Germany, 2011, http://hal.inria.fr/hal-00646089/en.
[BSJK11] N. Bertrand, A. Stainer, T. Jéron, M. Krichen. A game approach to determinize timed automata. In 14th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), LNCS, Volume 6604, Pages 245-259, SaarbrÃ¼cken, Germany, April 2011.
[GLGY12] Nan Guan, Mingsong Lv, Yu Ge and Wang Yi. WCET Analysis with MRU Caches: Challenging LRU for Predictability. To appear in the proc. of RTAS 2012.
[GSGY12] Nan Guan, Martin Stigge, Yu Ge, and Wang Yi. Parametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling. In the proc. of the 26th IEEE International Parallel and Distributed Processing Symposium. May 21-25, 2012, Shanghai, China.
[GESY11a] Nan Guan, Pontus Ekberg, Martin Stigge and Wang Yi. Effective and Efficient Scheduling of Certifiable Mixed-Criticality Sporadic Task Systems. In the proc. of IEEE RTSS 2011, Vienna, Austria. Nov 30 - Dec 2, 2011.
[LGDYY11] Mingsong Lv, Nan Guan, Qingxu Deng, Ge Yu, Wang Yi: McAiT - A Timing Analyzer for Multicore Real-Time Software. In the proc. Of ATVA 2011: 414-417.
[ZGXY11] Yi Zhang, Nan Guan, Yanbin Xiao, Wang Yi. Implementation and Empirical Comparison of Partitioning-based Multi-core Scheduling. In the proc. of the 6th IEEE International Symposium on Industrial Embedded Systems (SIES11), Vaesteraas, Sweden, June 15th - 17th, 2011.
[SEGY11a] Martin Stigge, Pontus Ekberg, Nan Guan, and Wang Yi. On the Tractability of Digraph-Based Task Models. In the proc of the 23rd Euromicro Conference on Real-Time Systems, Porto, Portugal July 6th - 8th, 2011.
[JGDY11] Xi Jin, Nan Guan, Qingxu Deng, Wang Yi. Memory Aware Mapping for Network-on-Chips, In the proc. of the 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2011), August 28-31, Toyama, Japan.
[GESY11b] Nan Guan, Pontus Ekberg, Martin Stigge and Wang Yi. Resource Sharing Protocols for Real-Time Task Graph Systems. In the proc. of the 23rd Euromicro Conference on Real-Time Systems. Porto, Portugal July 6th - 8th, 2011. (pdf)
[SEGY11b] Martin Stigge, Pontus Ekberg, Nan Guan and Wang Yi. The Digraph Real-Time Task Model. In the proc. of the 17th IEEE Real-Time and Embedded Technology and Applications Symposium, Chicago, IL, USA April 11 - 14, 2011. Best Paper Nomination.
[GYDGY11] Nan Guan, Wang Yi, Qingxu Deng, Zonghua Gu, Ge Yu. Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling. Journal of Systems Architecture – Embedded Systems Design 57(5): 536-546 (2011).
[KYD11] Fanxin Kong, Wang Yi, Qingxu Deng. Energy-efficient scheduling of real-time tasks on cluster-based multicores. In the proc. of DATE 2011: 1135-1140.
[KGDY11] Fanxin Kong, Nan Guan, Qingxu Deng, Wang Yi. Energy-efficient scheduling for parallel real-time tasks based on level-packing. In the proc of ACM SAC 2011: 635-640.
[Ruemmer12] Philipp Reummer. E-Matching with Free Variables. To appear in 18th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Marida, Venezuela, March 2012
[DHRK12] Alastair F. Donaldson, Nannan He, Philipp Reummer, Daniel Kroening. Tightening test coverage metrics: A case study in equivalence checking using k-induction. 9th International Symposium on Formal Methods for Components and Objects (FMCO), 2010, Graz, Austria. Revised papers
[BKRW11-2] Angelo Brillout, Daniel Kroening, Philipp RÃeummer, Thomas Wahl. An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic. Journal of Automated Reasoning, Volume 47 / 2011, Issue 4, Pages 341-367
[DKR11-2] Alastair F. Donaldson, Daniel Kroening, Philipp Reummer. Automatic Analysis of DMA Races Using Model Checking and k-induction. International Journal on Formal Methods in System Design (FMSD), Volume 39 / 2011, Number 1, pages 83-113
[DHKR11] Alastair F. Donaldson, Leopold Haller, Daniel Kroening, Philipp Reummer. Software Verification Using k-Induction. 18th International Static Analysis Symposium (SAS), Venice, Italy, September 2011
[HRK11] Nannan He, Philipp Reummer, Daniel Kroening. Test-case generation for embedded Simulink via formal concept analysis. Design Automation Conference (DAC), San Diego, USA, June 2011
[DKR11] Alastair F. Donaldson, Daniel Kroening, Philipp Reummer. SCRATCH: a tool for automatic analysis of DMA races. Poster at16th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP), San Antonio, TX, USA, 2011
[BKRW11] Angelo Brillout, Daniel Kroening, Philipp Reummer, Thomas Wahl. Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic. 12th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), Austin, Texas, January 2011.
[CKS11] S.S. Craciunas, C.M. Kirsch, and A. Sokolova. The Power of Isolation. Technical Report 2011-02. Department of Computer Sciences, University of Salzburg, July, 2011.
[RPMP11] Tizar Rizano, Roberto Passerone, David Macii and Luigi Palopoli, Model-Based Design of Embedded Control Software for Hybrid Vehicles. In Proceedings of the 6th IEEE International Symposium on Industrial Embedded Systems (SIES11), Västerås, Sweden, June 15-17, 2011.
[BGS11] BANNOUR B., GASTON C., SERVAT D., "Eliciting unitary constraints from timed Sequence Diagram with symbolic techniques: application to testing" to appear in Proceedings of Asian-Pacific Software Engineering Conference APSEC 2011
[EGL11] ESCOBEDO J.P., GASTON C., Le GALL P., "Timed Conformance Testing for Orchestrated Service Discovery", 8th International Symposium on Formal Aspects of Component Software: FACS 2011, September 14-16 2011
[BFLM11] Patricia Bouyer, Ulrich Fahrenberg, Kim G. Larsen, and Nicolas Markey. Quantitative modelling and analysis of embedded systems. Communications of the ACM, 2011. Invited paper.
[FTL11] Uli Fahrenberg, Claus Thrane, and Kim G. Larsen. Distances for weighted transition systems: Games and properties. In In Proceedings of Ninth Workshop on Quantitative Aspects of Programmaming Languages (QAPL’11), Electronic Proceedings in Theoretical Computer Science, 2011.
[BDLPW11] Gerd Behrmann, Alexandere David, Kim G. Larsen, Paul Pettersson, and Wang Yi. Developing UPPAAL over 15 years. Software - Practice and Experience, 41(2):133–142, 2011.
[LFT11] Kim G. Larsen, Uli Fahrenberg, and Claus Thrane. Metrics for weighted transition systems: Axiomatization and complexity. Theor. Comput. Sci., 412(28):3358–3369, 2011
[CMJNLN11] Yingke Chen, Hua Mao, Manfred Jaeger, Thomas D. Nielsen, Kim G. Larsen, and Brian Nielsen. Learning probabilistic automata for model checking. In The Eighth International Conference on Quantitative Evaluation of SysTems (QEST 2011). Accepted., Springer LNCS, 2011.
[MCL11] Radu Mardare, Luca Cardelli, and Kim G. Larsen. Continuous markovian logic - from complete axiomatization to the metric space of formulas. In Computer Science Logic (CSL), 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, September 12-15, 2011, Bergen, Norway, Proceedings, LIPIcs, pages 144–158. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,2011.
[CLM11] Luca Cardelli, Kim G. Larsen, and Radu Mardare. Modular markovian logic. In Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II, pages 380–391, 2011.
[FJLS11] Uli Fahrenberg, Line Juhl, Kim G. Larsen, and Jiri Srba. Energy games in multiweighted automata. In Proceedings of Theoretical Aspects of Computing (ICTAC’11) - 8th International Colloquium,Johannesburg, South Africa, volume 6916 of Lecture Notes in Computer Science, pages 95–115. Springer, 2011.
[BLMST11] Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, and Claus Thrane. Timed automata can always be made implementable. In CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings, volume 6901 of Lecture Notes in Computer Science, pages 76–91, 2011.
DHJLOOS11] Andreas Engelbredt Dalsgaard, René Rydhof Hansen, Kenneth Yrke Jørgensen, Kim Guldstrand Larsen, Mads Chr. Olesen, Petur Olsen, and Jirí Srba. opaal: A lattice model checker. In NASAFormal Methods - Third International Symposium, NFM 2011, Pasadena, CA, USA, April 18-20,2011. Proceedings, pages 487–493, 2011.
[BKLMS11] Beneš, J. Křesinský, K.G. Larsen, M.H. Møller, and J. Srba. Parametric modal transition systems. In Proceedings of the 9th International Symposium on Automated Technology for Verification and Analysis (ATVA’11), LNCS. Springer-Verlag, 2011.
[BHKLO11] Jörg Brauer, René Rydhof Hansen, Stefan Kowalewski, Kim G. Larsen, and Mads Chr. Olesen.Adaptable value-set analysis for low-level code. In Proceedings of The 6th International Workshop on Systems Software Verification (SSV2011), 2011.
[FLeT11] Uli Fahrenberg, Axel Legay, and Claus Thrane. The quantitative linear-time–branching-time spectrum. In Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2011.
[JJMS11] L. Jacobsen, M. Jacobsen, M.H. Møller, and J. Srba. Verification of timed-arc Petri nets. In Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’11), volume 6543 of LNCS, pages 46–72. Springer-Verlag, 2011.
-- The above are new references, not present in the Y3 deliverable --