Sciweavers

1418 search results - page 59 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
SAC
2010
ACM
15 years 1 months ago
A formal approach to reuse successful traceability practices in SPL projects
Software Product Line (SPL) Engineering has to deal with interrelated, complex models such as feature and architecture models, hence traceability is fundamental to keep them consi...
Angelina Espinoza, Goetz Botterweck, Juan Garbajos...
ECSQARU
1997
Springer
15 years 8 months ago
Cactus: A Branching-Time Logic Programming Language
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
Panos Rondogiannis, Manolis Gergatsoulis, Themis P...
235
Voted
POPL
2003
ACM
16 years 4 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
JUCS
2000
102views more  JUCS 2000»
15 years 3 months ago
Towards Two-Level Formal Modeling of Computer-Based Systems
: Embedded Computer-based Systems are becoming highly complex and hard to implement because of the large number of concerns the designers have to address. These systems are tightly...
Gabor Karsai, Greg Nordstrom, Ákos Lé...
WMTE
2008
IEEE
15 years 10 months ago
PALLAS: Personalised Language Learning on Mobile Devices
Mobile and ubiquitous learning facilitates language learners to continue their learning process outside the formal classroom, when and where they desire. While more and more learn...
Sobah Abbas Petersen, Jan-Kristian Markiewicz