Sciweavers

1750 search results - page 182 / 350
» Formal multiple-bernoulli models for language modeling
Sort
View
ICALP
2007
Springer
15 years 8 months ago
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
PLDI
2009
ACM
16 years 2 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
ICSE
2010
IEEE-ACM
15 years 6 months ago
Providing support for creating next generation software architecture languages
Many languages for software architectures have been proposed, each dealing with different stakeholder concerns, operating at different levels of abstraction and with different deg...
Ivano Malavolta
ECSA
2008
Springer
15 years 3 months ago
Non-synchronous Communications in Process Algebraic Architectural Description Languages
Abstract. Architectural description languages are a useful tool for modmplex software systems at a high level of abstraction and, if based on formal methods, for enabling the early...
Marco Bernardo, Edoardo Bontà
ICFP
2010
ACM
15 years 3 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao