Research output per year
Research output per year
- 18 results
Search results
-
2019
CSS Minification via Constraint Solving
Hague, M., Lin, A. & Hong, C.-D., 21 Jun 2019, In: ACM Transactions on Programming Languages and Systems. 41, 2, p. 1-76 76 p., 12.Research output: Contribution to journal › Article › peer-review
Open AccessFile94 Downloads (Pure) -
Decision procedures for path feasibility of string-manipulating programs with complex operations
Chen, T., Hague, M., Lin, A., Rümmer, P. & Wu, Z., 2 Jan 2019, (E-pub ahead of print) p. 1-30. 30 p.Research output: Contribution to conference › Paper › peer-review
Open Access -
2018
Constrained Dynamic Tree Networks
Hague, M. & Penelle, V., 2018, 12th International Conference on Reachability Problems. Springer International Publishing, p. 45-58 14 p. (Lecture Notes in Computer Science; vol. 11123).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile50 Downloads (Pure) -
Decidable models of integer-manipulating programs with recursive parallelism
Hague, M. & Lin, A., 30 Nov 2018, In: Theoretical Computer Science. 750, p. 24-37 14 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile38 Downloads (Pure) -
Optimal Strategies in Pushdown Reachability Games
Hague, M. & Carayol, A., 20 Aug 2018, International Symposium on Mathematical Foundations of Computer Science. p. 1-14 14 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 117).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access2 Downloads (Pure) -
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems
Hague, M., Meyer, R., Muskalla, S. & Zimmermann, M., 20 Aug 2018, International Symposium of Mathematical Foundations of Computer Science. p. 1-15 15 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 117).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
2017
Collapsible Pushdown Automata and Recursion Schemes
Hague, M., Murawski, A., Ong, C.-H. L. & Serre, O., 21 Aug 2017, In: ACM Transactions on Computational Logic. 18, 3, p. 1-42 42 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile68 Downloads (Pure) -
Domains for Higher-Order Games
Hague, M., Meyer, R. & Muskalla, S., 2017, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). LIPIcs, p. 59:1-59:15 15 p. 59Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile51 Downloads (Pure) -
What is decidable about string constraints with the ReplaceAll function
Chen, T., Chen, Y., Hague, M., Lin, A. & Wu, Z., 27 Dec 2017, (E-pub ahead of print) Proceedings of the ACM on Programming Languages. ACM, Vol. 2. p. 1-29 29 p. 3Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile90 Downloads (Pure) -
2016
Decidable Models of Integer-Manipulating Programs with Recursive Parallelism
Hague, M. & Lin, A., 13 Sept 2016, (E-pub ahead of print) Reachability Problems: 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings. Springer International Publishing, Vol. 9899. p. 148-162 15 p. (Lecture Notes in Computer Science; vol. 9899).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile59 Downloads (Pure) -
Generating Concurrency Checks Automatically
Hague, M. & Hoyland, J., 17 Jul 2016, Proceedings of the 18th Workshop on Formal Techniques for Java-like Programs . ACM, p. 1-15 15 p. 4Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile94 Downloads (Pure) -
Unboundedness and downward closures of higher-order pushdown automata
Hague, M., Kochems, J. & Ong, C.-H. L., 11 Jan 2016, Principles of Programming Languages: POPL '16. New York, NY: ACM, p. 151-163 13 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile116 Downloads (Pure) -
2015
Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach
Hague, M., Lin, A. & Ong, C.-H. L., 23 Oct 2015, OOPSLA 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications. New York, NY: ACM, p. 1-19 19 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile182 Downloads (Pure) -
2014
Regular Strategies in Pushdown Reachability Games
Hague, M. & Carayol, A., 2014, 8th International Workshop on Reachability Problems 2014. 13 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile69 Downloads (Pure) -
Saturation algorithms for model-checking pushdown systems
Hague, M. & Carayol, A., May 2014, Proceedings of the 14th International Conference on Automata and Formal Languages . 24 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile74 Downloads (Pure) -
Senescent ground tree rewrite systems
Hague, M., 14 Jul 2014, CSL-LICS '14 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). ACM, 10 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile95 Downloads (Pure) -
2013
C-SHORe: A Collapsible Approach to Verifying Higher-Order Programs
Broadbent, C., Carayol, A., Hague, M. & Serre, O., 25 Sept 2013, ICFP: International Conference on Functional Programming. p. 13-24 12 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile83 Downloads (Pure) -
Saturation of Concurrent Collapsible Pushdown Systems
Hague, M., 12 Dec 2013, FSTTCS: Foundations of Software Technology and Theoretical Computer Science. 12 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile87 Downloads (Pure)