English
Related papers

Related papers: Probabilistic Model Checking for Energy Analysis i…

200 papers

Engineering a product-line is more than just describing a product-line: to be correct, every variant that can be generated must satisfy some constraints. To ensure that all such variants will be correct (e.g. well-typed) there are only two…

Software Engineering · Computer Science 2024-08-02 Andreas Bayha , Vincent Aravantinos

Model checking real-time systems is complex, and requires a careful trade-off between including enough detail to be useful and not too much detail to avoid state explosion. This work exploits variability of the formal model being analysed…

Software Engineering · Computer Science 2023-11-01 José Proença , David Pereira , Giann Spilere Nandi , Sina Borrami , Jonas Melchert

In Software Product Line Engineering (SPLE), a portfolio of similar systems is developed from a shared set of software assets. Claimed benefits of SPLE include reductions in the portfolio size, cost of software development and time to…

Software Engineering · Computer Science 2016-03-30 Julia Rubin , Thomas Thüm

Many machine learning applications require the ability to learn from and reason about noisy multi-relational data. To address this, several effective representations have been developed that provide both a language for expressing the…

Artificial Intelligence · Computer Science 2012-03-19 Matthias Brocheler , Lilyana Mihalkova , Lise Getoor

A scoring system is a simple decision model that checks a set of features, adds a certain number of points to a total score for each feature that is satisfied, and finally makes a decision by comparing the total score to a threshold.…

Machine Learning · Computer Science 2024-08-01 Jonas Hanselle , Stefan Heid , Johannes Fürnkranz , Eyke Hüllermeier

The number of studies focusing on onboarding in software organizations has increased significantly during the last years. However, current literature overlooks onboarding in Software Product Lines (SPLs). SPLs have been proven effective in…

Software Engineering · Computer Science 2021-04-13 Raul Medeiros

Reliability in terms of functional properties from the safety-liveness spectrum is an indispensable requirement of low-level operating-system (OS) code. However, with evermore complex and thus less predictable hardware, quantitative and…

Probabilistic programs are a powerful and convenient approach to formalise distributions over system executions. A classical verification problem for probabilistic programs is temporal inference: to compute the likelihood that the execution…

Logic in Computer Science · Computer Science 2025-02-21 Kazuki Watanabe , Sebastian Junges , Jurriaan Rot , Ichiro Hasuo

Statistical Model Checking (SMC) is a trade-off between testing and formal verification. The core idea of the approach is to conduct some simulations of the system and verify if they satisfy some given property. In this paper we show that…

Software Engineering · Computer Science 2011-11-03 Peter Bulychev , Alexandre David , Kim Guldstrand Larsen , Marius Mikučionis , Axel Legay

In Software Product Line Engineering (SPLE) families of systems are designed, rather than developing the individual systems independently. Combinatorial Interaction Testing has proven to be effective for testing in the context of SPLE,…

Software Engineering · Computer Science 2013-12-06 Evelyn Nicole Haslinger , Roberto E. Lopez-Herrejon , Alexander Egyed

Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya's PRISM, Poole's ICL, Raedt et al's ProbLog and Vennekens et al's LPAD, is aimed at combining statistical and logical knowledge representation and inference. A key…

Artificial Intelligence · Computer Science 2012-10-09 Muhammad Asiful Islam , C. R. Ramakrishnan , I. V. Ramakrishnan

Property Specification Language (PSL) is a form of temporal logic that has been mainly used in discrete domains (e.g. formal hardware verification). In this paper, we show that by merging machine learning techniques with PSL monitors, we…

Machine Learning · Computer Science 2022-05-30 Kevin Smith , Hai Lin , Praveen Tiwari , Marjorie Sayer , Claudionor Coelho

Ensuring that safety-critical applications behave as intended is an important yet challenging task. Modeling languages like differential dynamic logic (dL) have proof calculi capable of proving guarantees for such applications. However, dL…

Formal Languages and Automata Theory · Computer Science 2024-10-08 Myra Dotzel , Stefan Mitsch , André Platzer

Formalisms for specifying statistical models, such as probabilistic-programming languages, typically consist of two components: a specification of a stochastic process (the prior), and a specification of observations that restrict the…

Databases · Computer Science 2015-01-06 Vince Barany , Balder ten Cate , Benny Kimelfeld , Dan Olteanu , Zografoula Vagena

Instrumenting programs for performing run-time checking of properties, such as regular shapes, is a common and useful technique that helps programmers detect incorrect program behaviors. This is specially true in dynamic languages such as…

Programming Languages · Computer Science 2018-04-09 Maximiliano Klemen , Nataliia Stulova , Pedro Lopez-Garcia , José F. Morales , Manuel V. Hermenegildo

Systems tend to become more and more complex. This has a direct impact on system engineering processes. Two of the most important phases in these processes are requirements engineering and quality assurance. Two significant complexity…

Software Engineering · Computer Science 2013-03-06 Stephan Weißleder , Hartmut Lackner

In many practical application domains, the software is organized into a set of threads, whose activation is exclusive and controlled by a cooperative scheduling policy: threads execute, without any interruption, until they either terminate…

Logic in Computer Science · Computer Science 2015-07-01 Alessandro Cimatti , Iman Narasamdya , Marco Roveri

In modern industrial settings, advanced acquisition systems allow for the collection of data in the form of profiles, that is, as functional relationships linking responses to explanatory variables. In this context, statistical process…

Methodology · Statistics 2025-10-30 Fabio Centofanti

Probabilistic pushdown automata (pPDA) are a standard operational model for programming languages involving discrete random choices and recursive procedures. Temporal properties are useful for specifying the chronological order of events…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Tobias Winkler , Christina Gehnen , Joost-Pieter Katoen

Static software checking tools are useful as an additional automated software inspection step that can easily be integrated in the development cycle and assist in creating secure, reliable and high quality code. However, an often quoted…

Software Engineering · Computer Science 2007-05-23 Cathal Boogerd , Leon Moonen
‹ Prev 1 4 5 6 7 8 10 Next ›