The APGAS programming model (Asynchronous Partitioned Global Address Space) is a simple but powerful model of concurrency and distribution, known primarily as the foundation of the X10 programming language but also developed for Java and Scala. APGAS combines PGAS with asynchrony. The data in an application is logically partitioned into places. The computation is organized into lightweight asynchronous tasks. APGAS can express both regular and irregular parallelism, within and across shared-memory nodes in a distributed system. Recently APGAS has been enriched to support failure-aware and elastic programming. Resilient applications can detect the loss of a place and implement recovery strategies. Elastic applications can dynamically add places to a running instance. In this talk, I will give an introduction to resilient and elastic APGAS, discussing design principles, implementation efforts, and applications.