The following pages link to S. Hallé (Q420852):
Displaying 16 items.
- Reasoning about visibility (Q420853) (← links)
- Declarative layout constraints for testing web applications (Q739635) (← links)
- Foundations of fine-grained explainability (Q832283) (← links)
- A Logical Approach to Data-Aware Automated Sequence Generation (Q2889859) (← links)
- Evaluation of diffusion models for airborne nanoparticles transport and dispersion (Q2920585) (← links)
- Pseudoperiodic Words (Q3167505) (← links)
- Solving Equations on Words with Morphisms and Antimorphisms (Q5404911) (← links)
- MULTIPSEUDOPERIODIC WORDS (Q5495426) (← links)
- Model Checking of Stream Processing Pipelines. (Q6080265) (← links)
- Formal verification for event stream processing: model checking of BeepBeep stream processing pipelines (Q6116186) (← links)
- Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem (Q6487934) (← links)
- Uncertainty in runtime verification: a survey (Q6580686) (← links)
- Benchmark for supply chain monitoring properties using BeepBeep (Q6695683) (← links)
- Structural Profiling of Web Sites in the Wild (Q6695685) (← links)
- Longitudinal study of website structure (Q6695688) (← links)
- Proportion of formal papers at FSE over the years (Q6695695) (← links)