1 |
Automatic Guide Generation for Stan via NumPyro
|
|
|
|
In: PROBPROG 2021 - Third International Conference on Probabilistic Programming ; https://hal.archives-ouvertes.fr/hal-03401708 ; PROBPROG 2021 - Third International Conference on Probabilistic Programming, Oct 2021, Virtual, United States (2021)
|
|
BASE
|
|
Show details
|
|
2 |
Bootstrap-Based Language Development: Turning an existing VM into a polyglot VM ; Développement de langages basé l’amorçage
|
|
|
|
In: https://tel.archives-ouvertes.fr/tel-03511998 ; Computer Science [cs]. Université de Lille; IMT Lille Douai, 2021. English (2021)
|
|
BASE
|
|
Show details
|
|
3 |
Computing with relations, functions, and bindings ; Calculer avec des relations, des fonctions et des lieurs
|
|
|
|
In: https://hal.archives-ouvertes.fr/tel-02414237 ; Logic in Computer Science [cs.LO]. Institut Polytechnique de Paris, 2019. English. ⟨NNT : 2019IPPAX005⟩ (2019)
|
|
BASE
|
|
Show details
|
|
4 |
Bridging High-Level Synthesis and Application-Specific Arithmetic: The Case Study of Floating-Point Summations
|
|
|
|
In: 27th International Conference on Field-Programmable Logic and Applications (FPL) ; https://hal.inria.fr/hal-01373954 ; 27th International Conference on Field-Programmable Logic and Applications (FPL), IEEE, Sep 2017, Gent, Belgium. pp.8 (2017)
|
|
BASE
|
|
Show details
|
|
5 |
Semantic-Directed Clumping of Disjunctive Abstract States *
|
|
|
|
In: POPL 2017 - 44th ACM SIGPLAN Symposium on Principles of Programming Languages ; https://hal.inria.fr/hal-01648679 ; POPL 2017 - 44th ACM SIGPLAN Symposium on Principles of Programming Languages, Jan 2017, Paris, France. pp.32-45, ⟨10.1145/3009837.3009881⟩ (2017)
|
|
BASE
|
|
Show details
|
|
6 |
SawjaCard: A Static Analysis Tool for Certifying Java Card Applications
|
|
|
|
In: 21st International Static Analysis Symposium (SAS 2014) ; https://hal.inria.fr/hal-01093327 ; 21st International Static Analysis Symposium (SAS 2014), 2014, Munich, Germany. pp.51 - 67, ⟨10.1007/978-3-319-10936-7_4⟩ (2014)
|
|
BASE
|
|
Show details
|
|
7 |
A Precise and Abstract Memory Model for C Using Symbolic Values
|
|
|
|
In: 12th Asian Symposium on Programming Languages and Systems (APLAS 2014) ; https://hal.inria.fr/hal-01093312 ; 12th Asian Symposium on Programming Languages and Systems (APLAS 2014), 2014, Singapore, Singapore. pp.449 - 468, ⟨10.1007/978-3-319-12736-1_24⟩ (2014)
|
|
BASE
|
|
Show details
|
|
8 |
The Package Blueprint: visually analyzing and quantifying package dependencies
|
|
|
|
In: ISSN: 0167-6423 ; Science of Computer Programming ; https://hal.inria.fr/hal-00957695 ; Science of Computer Programming, Elsevier, 2014, 89 (Part C), pp. 298-319. ⟨10.1016/j.scico.2014.02.016⟩ (2014)
|
|
BASE
|
|
Show details
|
|
9 |
Logically timed specifications in the AADL : a synchronous model of computation and communication (recommendations to the SAE committee on AADL)
|
|
|
|
In: https://hal.inria.fr/hal-00970244 ; [Technical Report] RT-0446, INRIA. 2014, pp.27 (2014)
|
|
BASE
|
|
Show details
|
|
10 |
Constraint satisfaction programming for video summarization
|
|
|
|
In: IEEE International Symposium on Multimedia ; https://hal.inria.fr/hal-00909370 ; IEEE International Symposium on Multimedia, Dec 2013, Anaheim, California, United States (2013)
|
|
BASE
|
|
Show details
|
|
11 |
Proofs You Can Believe In. Proving Equivalences Between Prolog Semantics in Coq
|
|
|
|
In: 15th International Symposium on Principles and Practice of Declarative Programming (PPDP) ; https://hal.inria.fr/hal-00908848 ; 15th International Symposium on Principles and Practice of Declarative Programming (PPDP), Sep 2013, Madrid, Spain. pp.37-48 (2013)
|
|
BASE
|
|
Show details
|
|
12 |
A Component-Based Approach for Specifying DSML's Concrete Syntax
|
|
|
|
In: 2nd Workshop on Graphical Modeling Language Development (GMLD 2013) ; https://hal.inria.fr/hal-00829173 ; 2nd Workshop on Graphical Modeling Language Development (GMLD 2013), Jul 2013, Montpellier, France. pp.3-11, ⟨10.1145/2489820.2489822⟩ (2013)
|
|
BASE
|
|
Show details
|
|
13 |
Flexible Object Layouts: enabling lightweight language extensions by intercepting slot access
|
|
|
|
In: Proceedings of 26th International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA '11) ; https://hal.inria.fr/hal-00641716 ; Proceedings of 26th International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA '11), Nov 2011, Portland, United States (2011)
|
|
BASE
|
|
Show details
|
|
14 |
Towards robust word discovery by self similarity matrix comparison
|
|
|
|
In: IEEE International Conference on Acoustics, Speech and Signal Processing ; https://hal.inria.fr/inria-00563418 ; IEEE International Conference on Acoustics, Speech and Signal Processing, May 2011, Prague, Czech Republic (2011)
|
|
BASE
|
|
Show details
|
|
15 |
A Certified Denotational Abstract Interpreter
|
|
|
|
In: International Conference on Interactive Theorem Proving (ITP) ; https://hal.inria.fr/inria-00537810 ; International Conference on Interactive Theorem Proving (ITP), 2010, Edimburgh, United Kingdom. pp.9-24 (2010)
|
|
Abstract:
International audience ; Abstract Interpretation proposes advanced techniques for static analysis of programs that raise specific challenges for machine-checked soundness proofs. Most classical dataflow analysis techniques iterate operators on lattices without infinite ascending chains. In contrast, abstract interpreters are looking for fixpoints in infinite lattices where widening and narrowing are used for accelerating the convergence. Smart iteration strategies are crucial when using such accelerating operators because they directly impact the precision of the analysis diagnostic. In this paper, we show how we manage to program and prove correct in Coq an abstract interpreter that uses iteration strategies based on program syntax. A key component of the formalization is the introduction of an intermediate semantics based on a generic least-fixpoint operator on complete lattices and allows us to decompose the soundness proof in an elegant manner.
|
|
Keyword:
[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]
|
|
URL: https://hal.inria.fr/inria-00537810/file/main.pdf https://hal.inria.fr/inria-00537810 https://hal.inria.fr/inria-00537810/document
|
|
BASE
|
|
Hide details
|
|
16 |
Language Boxes: Bending the Host Language with Modular Language Changes.
|
|
|
|
In: Software Language Engineering: Second International Conference, SLE 2009 ; https://hal.inria.fr/inria-00531044 ; Software Language Engineering: Second International Conference, SLE 2009, Oct 2009, Denver, United States. pp.274-293, ⟨10.1007/978-3-642-12107-4_20⟩ (2009)
|
|
BASE
|
|
Show details
|
|
17 |
Growing a Domain Specific Language with Split Extensions
|
|
|
|
In: https://hal.inria.fr/inria-00175805 ; [Research Report] RR-6314, INRIA. 2007 (2007)
|
|
BASE
|
|
Show details
|
|
18 |
Proceedings of the First Domain-Specific Aspect Languages Workshop - ACM International Conference on Generative Programming and Component Engineering (GPCE 2006)
|
|
|
|
In: https://hal.inria.fr/inria-00468283 ; [Research Report] 2006, pp.40 (2006)
|
|
BASE
|
|
Show details
|
|
19 |
Developing efficient parsers in Prolog: the CLF manual (v1.0)
|
|
|
|
In: https://hal.inria.fr/inria-00120518 ; [Technical Report] RT-0328, INRIA. 2006, pp.18 (2006)
|
|
BASE
|
|
Show details
|
|
20 |
When Categorial Grammars meet Regular Grammatical Inference
|
|
|
|
In: 5th International Conference on Logical Aspects of Computational Linguistics ; https://hal.inria.fr/inria-00536698 ; 5th International Conference on Logical Aspects of Computational Linguistics, 2005, Bordeaux, France. pp.317-332 (2005)
|
|
BASE
|
|
Show details
|
|
|
|